On the complexity of the lattices of subvarieties and congruences,International Journal of Algebra and Computation

当前位置： X-MOL 学术 › Int. J. Algebra Comput. › 论文详情

Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)

On the complexity of the lattices of subvarieties and congruences
International Journal of Algebra and Computation ( IF 0.8 ) Pub Date : 2020-07-21 , DOI: 10.1142/s0218196720500563
A. V. Kravchenko _{1,

2,

3,

4} , A. M. Nurakunov ₅ , M. V. Schwidefsky _{1,

2,

4}

Affiliation

We find sufficient conditions guaranteeing that for a quasivariety [Formula: see text] of structures of finite type containing a [Formula: see text]-class with respect to [Formula: see text], there exists a subquasivariety [Formula: see text] and a structure [Formula: see text] such that the problems whether a finite lattice embeds into the lattice [Formula: see text] of [Formula: see text]-varieties and into the lattice [Formula: see text] are undecidable.

中文翻译：