Monadic simultaneous rigid E-unification and related problems

DOI10.1007/3-540-63165-8_173zbMath1401.03037OpenAlexW1500424608MaRDI QIDQ4571948

Andrei Voronkov, Yuri Gurevich

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_173

Mathematics Subject Classification ID

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)

Related Items (6)

Monadic simultaneous rigid E-unification and related problems ⋮ Simultaneous rigid E-unification and other decision problems related to the Herbrand theorem ⋮ Decidability and complexity of simultaneous rigid E-unification with one variable and related results ⋮ The existential theory of equations with rational constraints in free groups is PSPACE-complete ⋮ Logic with equality: Partisan corroboration and shifted pairing ⋮ On the undecidability of second-order unification

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The undecidability of simultaneous rigid E-unification
• Special cases and substitutes for rigid \(E\)-unification
• An algorithm for reasoning about equality
• Complexity of Makanin's algorithm
• Monadic simultaneous rigid E-unification and related problems

This page was built for publication: Monadic simultaneous rigid E-unification and related problems