Almost free algebras have polynomial-time decidable problems for canonical forms, class cardinalities, finiteness checks, and isomorphism, plus quantifier elimination after adding tester predicates via a new approach.
A decision procedure for term algebras with queues.ACM Transactions on Computational Logic, 2:155–181, 04 2001
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Almost free algebras: from the word problem to elimination of quantifiers
Almost free algebras have polynomial-time decidable problems for canonical forms, class cardinalities, finiteness checks, and isomorphism, plus quantifier elimination after adding tester predicates via a new approach.