On the complexity of the lattices of subvarieties and congruences

A. V. Kravchenko; A. M. Nurakunov; M. V. Schwidefsky

doi:10.1142/S0218196720500563

On the complexity of the lattices of subvarieties and congruences

A. V. Kravchenko, A. M. Nurakunov, M. V. Schwidefsky

Кафедра дискретной математики и информатики ММФ и СУНЦ

Результат исследования: Научные публикации в периодических изданиях › статья › рецензирование

2 Цитирования (Scopus)

Аннотация

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 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.

Язык оригинала	английский
Журнал	International Journal of Algebra and Computation
DOI	https://doi.org/10.1142/S0218196720500563
Состояние	Принято в печать - 2020

Доступ к документу

10.1142/S0218196720500563

Link to publication in Scopus

Fingerprint Подробные сведения о темах исследования «On the complexity of the lattices of subvarieties and congruences». Вместе они формируют уникальный семантический отпечаток (fingerprint).

Цитировать

@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 {\^a}{\v S}†M and a structure 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.}",

year = "2020",

doi = "10.1142/S0218196720500563",

language = "English",

journal = "International Journal of Algebra and Computation",

issn = "0218-1967",

publisher = "World Scientific Publishing Co. Pte Ltd",

}

TY - JOUR

T1 - On the complexity of the lattices of subvarieties and congruences

AU - Kravchenko, A. V.

AU - Nurakunov, A. M.

AU - Schwidefsky, M. V.

PY - 2020

Y1 - 2020

N2 - 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 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.

AB - 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 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.

KW - Computable set

KW - congruence

KW - lattice

KW - undecidable problem

KW - variety

UR - http://www.scopus.com/inward/record.url?scp=85091754248&partnerID=8YFLogxK

U2 - 10.1142/S0218196720500563

DO - 10.1142/S0218196720500563

M3 - Article

AN - SCOPUS:85091754248

JO - International Journal of Algebra and Computation

JF - International Journal of Algebra and Computation

SN - 0218-1967

ER -