The undecidability of the DA-unification problem

DOI10.2307/2274856zbMath0701.03020OpenAlexW2577911961MaRDI 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

zbMATH Keywords

unification problemreduction to Hilbert's tenth problem

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Artificial intelligence (68T99)

Related Items (7)

Characterizations of \(N(2,2, 0)\) algebras ⋮ Unification in commutative semigroups ⋮ Knowledge-based proof planning ⋮ Unification theory ⋮ Hilbert's tenth problem is of unification type zero ⋮ Unification modulo ACUI plus distributivity axioms ⋮ Unification problem in equational theories

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

This page was built for publication: The undecidability of the D_A-unification problem