On the complexity of the lattices of subvarieties and congruences

Standard

On the complexity of the lattices of subvarieties and congruences. / Kravchenko, A. V.; Nurakunov, A. M.; Schwidefsky, M. V.

In: International Journal of Algebra and Computation, Vol. 30, No. 8, 12.2020, p. 1609-1624.

Research output: Contribution to journal › Article › peer-review

Harvard

Kravchenko, AV, Nurakunov, AM & Schwidefsky, MV 2020, 'On the complexity of the lattices of subvarieties and congruences', International Journal of Algebra and Computation, vol. 30, no. 8, pp. 1609-1624. https://doi.org/10.1142/S0218196720500563

APA

Kravchenko, A. V., Nurakunov, A. M., & Schwidefsky, M. V. (2020). On the complexity of the lattices of subvarieties and congruences. International Journal of Algebra and Computation, 30(8), 1609-1624. https://doi.org/10.1142/S0218196720500563

Vancouver

Kravchenko AV, Nurakunov AM, Schwidefsky MV. On the complexity of the lattices of subvarieties and congruences. International Journal of Algebra and Computation. 2020 Dec;30(8):1609-1624. doi: 10.1142/S0218196720500563

Author

Kravchenko, A. V. ; Nurakunov, A. M. ; Schwidefsky, M. V. / On the complexity of the lattices of subvarieties and congruences. In: International Journal of Algebra and Computation. 2020 ; Vol. 30, No. 8. pp. 1609-1624.

BibTeX

@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.}",

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",

}

RIS

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/12

Y1 - 2020/12

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

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

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

VL - 30

SP - 1609

EP - 1624

JO - International Journal of Algebra and Computation

JF - International Journal of Algebra and Computation

SN - 0218-1967

IS - 8

ER -

ID: 25677640