RUS  ENG
Full version
JOURNALS // Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports] // Archive

Sib. Èlektron. Mat. Izv., 2017 Volume 14, Pages 1147–1152 (Mi semr854)

Mathematical logic, algebra and number theory

Finite algebras with non-computable morphisms

M. S. Sheremetab

a Sobolev Institute of Mathematics, pr. Koptyuga, 4, 630090, Novosibirsk, Russia
b Siberian Institute of Management RANEPA, ul. Nizhegorodskaya, 6, 630102, Novosibirsk, Russia

Abstract: We construct a variety $\mathbf V$ of partial algebgras with a finite basis of Kleene identities and a computable sequence $(\mathcal A_n \mid n< \omega)$ of finite algebras in $\mathbf V$ with a non-computable set $\{n \mid \mathcal A_n\ \text{is simple in}\ \mathbf V\}$, where the property ‘simple’ is considered with respect to epimorphisms.

Keywords: partial algebra, quasi-variety, epimorphism, computable sequence.

UDC: 512.5, 510.53

MSC: 08A55, 08A50

Received April 27, 2017, published November 14, 2017

DOI: 10.17377/semi.2017.14.098



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024