A new method for undecidability proofs of first order theories
- 1 January 1990
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Unification theoryJournal of Symbolic Computation, 1989
- Equational problems anddisunificationJournal of Symbolic Computation, 1989
- Termination of rewritingJournal of Symbolic Computation, 1987
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- A Unification Algorithm for Associative-Commutative FunctionsJournal of the ACM, 1981
- Unsolvable ProblemsPublished by Elsevier ,1977
- I: A General Method in Proofs of UndecidabilityPublished by Elsevier ,1953
- Concatenation as a basis for arithmeticThe Journal of Symbolic Logic, 1946
- A variant of a recursively unsolvable problemBulletin of the American Mathematical Society, 1946
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme IMonatshefte für Mathematik, 1931