On unification: Equational theories are not bounded

DOI10.1016/S0747-7171(86)80001-3zbMath0629.68037OpenAlexW1988552011MaRDI QIDQ1094131

Ronald V. Book, Jörg H. Siekmann

Publication date: 1986

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(86)80001-3

zbMATH Keywords

equational theoriesfirst-order unification

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (3)

The complexity of counting problems in equational matching ⋮ The unification hierarchy is undecidable ⋮ On equational theories, unification, and (un)decidability

Cites Work

• A Unification Algorithm for Associative-Commutative Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On unification: Equational theories are not bounded