Determining Unify-Stable Presentations

DOI10.1007/978-3-540-73449-9_7MaRDI QIDQ5432333zbMATH OpenOpenAlexFDO

Authors Thierry Boy de la Tour, Mnacho Echenim

Publication date 2 January 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73449-9_7

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 4041328
• The unification hierarchy is undecidable
• Finite acyclic theories are unitary
• On equational theories, unification, and (un)decidability
• Term Rewriting and Applications

This page was built for publication: Determining Unify-Stable Presentations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5432333)