A new method for undecidability proofs of first order theories-Reference-Cited by-同舟云学术

A new method for undecidability proofs of first order theories

Published:1990 Issue: Volume: Page:48-62
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Treinen Ralf

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-53487-3_34.pdf

Reference26 articles.

1. Hans-Jürgen Bürckert, Alexander Herold, and Manfred Schmidt-Schauß. On Equational Theories, Unification and Decidability. SEKI-Report SR-86-20, Universität Kaiserslautern, 1986.

2. Hans-Jürgen Bürckert and Manfred Schmidt-Schauß. On the Solvability of Equational Problems. SEKI Report SR-89-07, Universität Kaiserslautern, 1989.

3. Hubert Comon and Pierre Lescanne. Equational problems and disunification. Journal of Symbolic Computation, 7(3,4):371–425, 1989.

4. Hubert Comon. Unification et Disunification. Théorie et Applications. PhD thesis, Institut National Polytechnique de Grenoble, Grenoble, France, 1988.

5. Hubert Comon. Disunification:A Survey. Rapport de Recherche no. 540, LRI, Université de Pairs Sud, january 1990.

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The ∃*∀* Part of the Theory of Ground Term Algebra Modulo an AC Symbol is Undecidable;Information and Computation;2002-11

2. The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary Signatures;FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science;2002

3. Problems in rewriting III;Rewriting Techniques and Applications;1995

4. A solution of the complement problem in associatiue-commutatiue theories;Word Equations and Related Topics;1993

5. Complement problems and tree automata in AC-like theories (extended abstract);Lecture Notes in Computer Science;1993