Simultaneous rigid E-unification is undecidable
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 178-190
- https://doi.org/10.1007/3-540-61377-3_38
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- An ordered theory resolution calculusPublished by Springer Nature ,2005
- A complete connection calculus with rigid E-unificationPublished by Springer Nature ,2005
- Theorem proving using equational matings and rigid E -unificationJournal of the ACM, 1992
- Linear logicTheoretical Computer Science, 1987
- An Improved Proof ProcedurePublished by Springer Nature ,1983
- The undecidability of the second-order unification problemTheoretical Computer Science, 1981
- On Matrices with ConnectionsJournal of the ACM, 1981
- Theorem Proving via General MatingsJournal of the ACM, 1981
- An algorithm for reasoning about equalityCommunications of the ACM, 1978
- Mechanical Theorem-Proving by Model EliminationJournal of the ACM, 1968