The \(\exists^*\forall^*\) part of the theory of ground term algebra modulo an AC symbol is undecidable.

DOI10.1006/INCO.2002.3145zbMath1049.03031OpenAlexW2058284624MaRDI QIDQ1400708

Jerzy Marcinkowski

Publication date: 2002

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/5e5ea6f8deb48de397ddb83013e1644e9e39ffd5

zbMATH Keywords

decidabilityunification

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42) Equational classes, universal algebra in model theory (03C05)

Cites Work

• Complete axiomatizations of some quotient term algebras
• A new method for undecidability proofs of first order theories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The \(\exists^*\forall^*\) part of the theory of ground term algebra modulo an AC symbol is undecidable.