On the complexity of the lattices of subvarieties and congruences

DOI10.1142/S0218196720500563zbMath1484.08013OpenAlexW3043919832MaRDI QIDQ5135742

Aleksandr Vladimirovich Kravchenko, Anvar M. Nurakunov, M. V. Schwidefsky

Publication date: 23 November 2020

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

Full work available at URL: https://doi.org/10.1142/s0218196720500563

zbMATH Keywords

latticevarietycongruencecomputable setundecidable problem

Mathematics Subject Classification ID

Lattices of varieties (08B15) Subalgebras, congruence relations (08A30) Quasivarieties (08C15) Axiomatic model classes (08C10)

Related Items

Structure of quasivariety lattices. IV: Nonstandard quasivarieties ⋮ Structure of quasivariety lattices. III: Finitely partitionable bases

Cites Work

• Complexity of quasivariety lattices.
• On representation of finite lattices
• Lattices of subclasses
• Structure of quasivariety lattices. I: Independent axiomatizability
• Structure of quasivariety lattices. II: Undecidable problems
• Quasivariety lattices of pointed abelian groups.
• UNREASONABLE LATTICES OF QUASIVARIETIES
• Q-Universal Quasivarieties of Algebras
• Lattices of subclasses. II
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of the lattices of subvarieties and congruences