On the complexity of quasivariety lattices

DOI10.17377/semi.2017.14.010zbMath1357.08004MaRDI QIDQ515205

Svetlana Mihailovna Lutsak

Publication date: 13 March 2017

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

zbMATH Keywords

latticequasivarietycomputable setQ-universality

Mathematics Subject Classification ID

Lattices of varieties (08B15) Representation theory of lattices (06B15) Quasivarieties (08C15) Applications of computability and recursion theory (03D80)

Related Items (1)

Structure of quasivariety lattices. I: Independent axiomatizability

Cites Work

• Unnamed Item
• Unnamed Item
• \(\Phi\)-harmonic functions on discrete groups and the first \(\ell^\Phi\)-cohomology
• The lattice of quasivarieties of semigroups
• Open questions related to the problem of Birkhoff and Maltsev
• Finite-to-finite universal quasivarieties are \(Q\)-universal.
• Lattices of subclasses
• Quasivariety lattices of pointed abelian groups.
• UNREASONABLE LATTICES OF QUASIVARIETIES
• Q-Universal Quasivarieties of Algebras
• SUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, II.
• Lattices of subclasses. II

This page was built for publication: On the complexity of quasivariety lattices