A New Method for Undecidability Proofs of First Order Theories (1992)

Cached

Download Links

by Ralf Treinen
Venue:Journal of Symbolic Computation
Citations:30 - 7 self

Documents Related by Co-Citation

164 Solving Equations in Abstract Algebras: a Rule-Based Survey of Unification – J-P Jouannaud, C Kirchner - 1991
137 Complete axiomatization of the algebra of finite, rational and infinite trees – M Maher - 1982
30 Decidability of the purely existential fragment of the theory of term algebras – K Venkataraman - 1987
57 Disunification: a Survey – Hubert Comon - 1991
50 Solving Symbolic Ordering Constraints – Hubert Comon - 1990
106 Equational Problems and Disunification – Hubert Comon, Pierre Lescanne - 1989
36 Satisfiability of systems of ordinal notations with the subterm property is decidable – Jean-Pierre Jouannaud, Mitsuhiro Okada - 1991
755 Inductive-Data-Type Systems – Frederic Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada - 2002
46 Axiomatizable classes of locally free algebras of various types – A Malcev - 1971
9 Decidability of the existential theory of infinite terms with subterm relation – S Tulipani - 1994
786 The Semantics Of Constraint Logic Programs – Joxan Jaffar, Michael Maher, Kim Marriott, Peter Stuckey - 1996
454 Rewriting – Nachum Dershowitz, David A. Plaisted - 2001
283 Decidability of second-order theories and automata on infinite trees – Michael O Rabin - 1969
10 Complete Axiomatizations of some Quotient Term Algebras – Hubert Comon - 1993
15 Equational formulas on order-sorted algebras – H Comon - 1990
44 Reduction properties and automata with constraints – M Dauchet, A-C Caron, J-L Coquidé - 1995
47 Theorem proving with ordering constrained clauses – R Nieuwenhuis, A Rubio - 1992
58 M.: On word problems in equational theories – J Hsiang, Rusinowitch - 1987
35 On subsumption and semi-unification in feature algebras – Jochen Dörre, William C Rounds - 1989