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.
Complete axiomatizations of some quotient term algebras.Theoretical Computer Science, 118(2):167–191
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.