On the complexity of the lattices of subvarieties and congruences

On the complexity of the lattices of subvarieties and congruences Full article

Journal

International Journal of Algebra and Computation
ISSN: 0218-1967 , E-ISSN: 1793-6500

Output data

Year: 2020, Volume: 30, Number: 8, Pages: 1609-1624 Pages count : 16 DOI: 10.1142/S0218196720500563

Tags

Computable set; congruence; lattice; undecidable problem; variety

Authors

Kravchenko A.V. ^1,2,3,4 , Nurakunov A.M. ⁵ , Schwidefsky M.V. ^1,2,4

Affiliations

1	Sobolev Institute of Mathematics SB RAS, 4 Acad. Koptyug Prosp., Novosibirsk, 630090, Russian Federation
2	Novosibirsk State University, 1 Pirogov St., Novosibirsk, 630090, Russian Federation
3	Siberian Institute of Management, Dept. of the Russ. Acad. of Natl. Econ. and Pub. Admin. under the Pres. of the Russian Federation, 6 Nizhegorodskaya St., Novosibirsk, 630102, Russian Federation
4	Novosibirsk State Technical University, 20 Karl Marx Prosp., Novosibirsk, 630073, Russian Federation
5	Institute of Mathematics of the National Academy of Sciences, Bishkek

We find sufficient conditions guaranteeing that for a quasivariety M of structures of finite type containing a B-class with respect to M, there exists a subquasivariety K⊂M and a structure AϵK such that the problems whether a finite lattice embeds into the lattice Lv(K) of K-varieties and into the lattice ConK are undecidable. © 2020 World Scientific Publishing Company.

Kravchenko A.V. , Nurakunov A.M. , Schwidefsky M.V.
On the complexity of the lattices of subvarieties and congruences
International Journal of Algebra and Computation. 2020. V.30. N8. P.1609-1624. DOI: 10.1142/S0218196720500563 WOS Scopus OpenAlex

Web of science:	WOS:000599887200005
Scopus:	2-s2.0-85091754248
OpenAlex:	W3043919832

DB	Citing
Scopus	4
OpenAlex	4
Web of science	4