@article{a82fdb888126495fa147c1a43eb1297e,
title = "On the complexity of the lattices of subvarieties and congruences",
abstract = "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. ",
keywords = "Computable set, congruence, lattice, undecidable problem, variety",
author = "Kravchenko, {A. V.} and Nurakunov, {A. M.} and Schwidefsky, {M. V.}",
note = "Publisher Copyright: {\textcopyright} 2020 World Scientific Publishing Company. Copyright: Copyright 2020 Elsevier B.V., All rights reserved.",
year = "2020",
month = dec,
doi = "10.1142/S0218196720500563",
language = "English",
volume = "30",
pages = "1609--1624",
journal = "International Journal of Algebra and Computation",
issn = "0218-1967",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "8",
}