Geodesic
A semilattice generated by superlow computably enumerable degrees
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 1 (2011), pp. 85-90

Voir la notice de l'article provenant de la source Math-Net.Ru

We prove that a partially ordered set of all computably enumerable (c.e.) degrees that are the least upper bounds of two superlow c.e. degrees is an upper semilattice not elementary equivalent to the semilattice of all c.e. degrees.
Keywords: superlow degrees, low degrees, totally c.e. degrees, critical triples. 
@article{IVM_2011_1_a7,
     author = {M. Kh. Faizrakhmanov},
     title = {A semilattice generated by superlow computably enumerable degrees},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {85--90},
     publisher = {mathdoc},
     number = {1},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_2011_1_a7/}
}
TY  - JOUR
AU  - M. Kh. Faizrakhmanov
TI  - A semilattice generated by superlow computably enumerable degrees
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 2011
SP  - 85
EP  - 90
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_2011_1_a7/
LA  - ru
ID  - IVM_2011_1_a7
ER  - 
%0 Journal Article
%A M. Kh. Faizrakhmanov
%T A semilattice generated by superlow computably enumerable degrees
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 2011
%P 85-90
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_2011_1_a7/
%G ru
%F IVM_2011_1_a7
M. Kh. Faizrakhmanov. A semilattice generated by superlow computably enumerable degrees. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 1 (2011), pp. 85-90. http://geodesic.mathdoc.fr/item/IVM_2011_1_a7/