|
This article is cited in 6 scientific papers (total in 6 papers)
Quasivarieties of graphs and independent axiomatizability
A. V. Kravchenkoabc, A. V. Yakovlevb a Sobolev Institute of Mathematics, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
c Siberian Institute of Management (Department of RANEPA), Novosibirsk, Russia
Abstract:
In the present article, we continue to study the complexity of the lattice of quasivarieties of graphs. For every quasivariety $\mathbf{K}$ of graphs that contains a non-bipartite graph, we find a subquasivariety $\mathbf{K}^\prime\subseteq\mathbf{K}$ such that there exist $2^\omega$ subquasivarieties $\mathbf{K}^{\prime\prime}\in\mathrm{L_q}(\mathbf{K}^\prime)$ without covers (hence, without independent bases for their quasi-identities in $\mathbf{K}^\prime$).
Key words:
quasivariety, graph, basis for quasi-identities.
Received: 13.02.2017
Citation:
A. V. Kravchenko, A. V. Yakovlev, “Quasivarieties of graphs and independent axiomatizability”, Mat. Tr., 20:2 (2017), 80–89; Siberian Adv. Math., 28:1 (2018), 53–59
Linking options:
https://www.mathnet.ru/eng/mt324 https://www.mathnet.ru/eng/mt/v20/i2/p80
|
Statistics & downloads: |
Abstract page: | 260 | Full-text PDF : | 60 | References: | 36 | First page: | 5 |
|