UNREASONABLE LATTICES OF QUASIVARIETIES

DOI10.1142/S0218196711006728zbMath1255.08002MaRDI QIDQ2888832

Anvar M. Nurakunov

Publication date: 4 June 2012

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

quasivarietycongruencecomputable setBirkhoff-Mal'tsev problemunarquasivariety latticeundecidable quasi-equational theory

Mathematics Subject Classification ID

Lattices of varieties (08B15) Complete lattices, completions (06B23) Quasivarieties (08C15) Applications of computability and recursion theory (03D80) Unary algebras (08A60)

Related Items (14)

Lattices of subclasses. III ⋮ Lattices of subclasses ⋮ Complexity of quasivariety lattices. ⋮ On sufficient conditions for \(Q\)-universality ⋮ On a class of subsemigroup lattices ⋮ Quasivarieties of Graphs and Independent Axiomatizability ⋮ On the complexity of the lattices of subvarieties and congruences ⋮ A juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots). ⋮ On the complexity of quasivariety lattices ⋮ Lattices of subclasses. II ⋮ Structure of quasivariety lattices. I: Independent axiomatizability ⋮ Structure of quasivariety lattices. II: Undecidable problems ⋮ On the complexity of the lattices of subvarieties and congruences. II: Differential groupoids and unary algebras ⋮ Quasivariety lattices of pointed abelian groups.

Cites Work

• Unnamed Item
• Equational closure operator and forbidden semidistributive lattices
• On atoms in the lattice of quasivarieties
• A perspective on algebraic representations of lattices
• Finite basis problems and results for quasivarieties
• Open questions related to the problem of Birkhoff and Maltsev
• Finite lattices as relative congruence lattices of finite algebras
• Quasiequational Theories of Flat Algebras
• A Note on the Implicational Class Generated by a Class of Structures
• TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE

This page was built for publication: UNREASONABLE LATTICES OF QUASIVARIETIES