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

quasivariety; congruence; computable set; Birkhoff-Mal'tsev problem; unar; quasivariety lattice; undecidable quasi-equational theory

Mathematics Subject Classification ID

08B15: Lattices of varieties

06B23: Complete lattices, completions

08C15: Quasivarieties

03D80: Applications of computability and recursion theory

08A60: Unary algebras

Related Items

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

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