Complete axiomatizations of some quotient term algebras
DOI10.1016/0304-3975(93)90108-6zbMath0810.03026OpenAlexW2070687667MaRDI QIDQ685393
Publication date: 20 April 1995
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(93)90108-6
first-order theoryexistential fragment of the theory of associative-commutative function symbolsquasi-free theory
Applications of universal algebra in computer science (08A70) Decidability of theories and sets of sentences (03B25) Equational classes, universal algebra in model theory (03C05) Axiomatic model classes (08C10) Quantifier elimination, model completeness, and related topics (03C10)
Related Items (12)
Cites Work
- Complete axiomatizations of some quotient term algebras
- Equational problems and disunification
- Decidability of the existential theory of infinite terms with subterm relation
- Proving termination with multiset orderings
- Fast Decision Procedures Based on Congruence Closure
- Higher-order unification, polymorphism, and subsorts
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Complete axiomatizations of some quotient term algebras