The undecidability of the DA-unification problem
From MaRDI portal
Publication:3478395
DOI10.2307/2274856zbMath0701.03020MaRDI QIDQ3478395
No author found.
Publication date: 1989
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2274856
Related Items
Hilbert's tenth problem is of unification type zero, Unification problem in equational theories, Unification in commutative semigroups, Unification modulo ACUI plus distributivity axioms, Knowledge-based proof planning
Cites Work
- Unnamed Item
- Unification under associativity and idempotence is of type nullary
- Unification in varieties of idempotent semigroups
- The undecidability of the second-order unification problem
- Complete sets of unifiers and matchers in equational theories
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Hilbert's Tenth Problem is Unsolvable
- A Machine-Oriented Logic Based on the Resolution Principle
- The Concept of Demodulation in Theorem Proving
- The undecidability of unification in third order logic