Abstract
We construct a countably infinite descending chain of Q-universal quasivarieties of graphs, starting with D, and show that its intersection has a distributive countably infinite lattice of subquasivarieties. It is also proved that the quasivariety of symmetric endographs is Q-universal.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Sapir, “The lattice of quasivarieties of semigroups,”Alg. Univ.,21, 172–180 (1985).
S. V. Sizyi, “Quasivarieties of graphs,”Sib. Mat. Zh.,35, No. 4, 879–892 (1994).
I. M. Vazhenin and S. V. Sizyi, “Quasivarieties of endomodels,”Izv. Vyssh. Uch. Zav., No. 2, 66–67 (1988).
S. V. Sizyi, “The lattice of quasivarieties of endomodels,” inAlgebraic Systems and Their Varieties, Sverdlovsk (1988), pp. 120–137.
S. V. Sizyi, “Minimal quasivarieties of endographs,”Mat. Zametki,51, No. 6, 59–68 (1992).
V. A. Gorbunov and V. I. Tumanov, “Structure of lattices of quasivarieties,”Trudy Inst. Mat. SO AN SSSR,2, 12–44 (1982).
V. A. Gorbunov, “Structure of lattices of varieties and lattices of quasivarieties: similarity and difference. II,”Algebra Logika,34, No. 4, 369–397 (1995).
Additional information
Translated fromAlgebra i Logika, Vol. 36, No. 3, pp. 273–281, May–June, 1997.
Rights and permissions
About this article
Cite this article
Kravchenko, A.V. The lattice complexity of quasivarieties of graphs and endographs. Algebr Logic 36, 164–168 (1997). https://doi.org/10.1007/BF02671614
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02671614