Geodesic
Truth tabular degrees of recursively enumerable sets
Matematičeskie zametki, Tome 14 (1973) no. 5, pp. 697-702 
S. Kallibekov. Truth tabular degrees of recursively enumerable sets. Matematičeskie zametki, Tome 14 (1973) no. 5, pp. 697-702. http://geodesic.mathdoc.fr/item/MZM_1973_14_5_a9/
@article{MZM_1973_14_5_a9,
     author = {S. Kallibekov},
     title = {Truth tabular degrees of recursively enumerable sets},
     journal = {Matemati\v{c}eskie zametki},
     pages = {697--702},
     year = {1973},
     volume = {14},
     number = {5},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_1973_14_5_a9/}
}
TY  - JOUR
AU  - S. Kallibekov
TI  - Truth tabular degrees of recursively enumerable sets
JO  - Matematičeskie zametki
PY  - 1973
SP  - 697
EP  - 702
VL  - 14
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/MZM_1973_14_5_a9/
LA  - ru
ID  - MZM_1973_14_5_a9
ER  - 
%0 Journal Article
%A S. Kallibekov
%T Truth tabular degrees of recursively enumerable sets
%J Matematičeskie zametki
%D 1973
%P 697-702
%V 14
%N 5
%U http://geodesic.mathdoc.fr/item/MZM_1973_14_5_a9/
%G ru
%F MZM_1973_14_5_a9

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

The upper semilattice of truth tabular degrees of recursively enumerable (r.e.) sets is studied. It is shown that there exists an infinite set of pairwise tabularly incomparable truth tabular degrees higher than any tabularly incomplete r.e. truth tabular degree. A similar assertion holds also for r.e. $m$-degrees. Hence follows that a complete truth tabular degree contains an infinite antichain of r.e. $m$-degrees.