Monadic simultaneous rigid \(E\)-unification

DOI10.1016/S0304-3975(98)00123-6zbMath0930.03007MaRDI QIDQ1960540

Andrei Voronkov, Yuri Gurevich

Publication date: 12 January 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

equational logicdecision problemword equationsregular constraintssimultaneous rigid E-unification

Mathematics Subject Classification ID

Combinatorics on words (68R15) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Complexity of computation (including implicit computational complexity) (03D15) Word problems, etc. in computability and recursion theory (03D40) Subsystems of classical logic (including intuitionistic logic) (03B20)

Cites Work

• The undecidability of simultaneous rigid E-unification
• Decidability and complexity of simultaneous rigid E-unification with one variable and related results
• Simultaneous rigid E-unification and other decision problems related to the Herbrand theorem
• Special cases and substitutes for rigid \(E\)-unification
• An algorithm for reasoning about equality
• Complexity of Makanin's algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Monadic simultaneous rigid \(E\)-unification