The decidability of the affine completeness generation problem.

DOI10.1007/S00012-002-8208-XzbMath1062.08006OpenAlexW2069329186MaRDI QIDQ1771940

Kalle Kaarli, Alden F. Pixley

Publication date: 19 April 2005

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00012-002-8208-x

zbMATH Keywords

decidabilitynear unanimity termaffine complete varietyvariety generation

Mathematics Subject Classification ID

Equational logic, Mal'tsev conditions (08B05) Operations and polynomials in algebraic structures, primal algebras (08A40) Congruence modularity, congruence distributivity (08B10)

Related Items (1)

The computational complexity of deciding whether a finite algebra generates a minimal variety

This page was built for publication: The decidability of the affine completeness generation problem.