A new method for undecidability proofs of first order theories
Author:
- Ralf TreinenRTRalf Treinen
- 1 November 1992
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 14 (5) , 437-457
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- SOLVING SYMBOLIC ORDERING CONSTRAINTSInternational Journal of Foundations of Computer Science, 1990
- On equational theories, unification, and (Un)decidabilityJournal of Symbolic Computation, 1989
- Equational problems anddisunificationJournal of Symbolic Computation, 1989
- Associative-commutative unificationJournal of Symbolic Computation, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- Fundamental properties of infinite treesTheoretical Computer Science, 1983
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- 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