Geodesic
About Not Countable Ideals in a Semi-Lattice of~the~Enumeration Degrees
Modelirovanie i analiz informacionnyh sistem, Tome 19 (2012) no. 5, pp. 74-80.

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

This paper is dedicated to the study of ideals in semi-lattice of the enumeration degrees.
Keywords: ideals enumeration degrees, enumeration reducible
Mots-clés : immune set. 
@article{MAIS_2012_19_5_a7,
     author = {B. I. Solon and V. V. Tikhov},
     title = {About {Not} {Countable} {Ideals} in a {Semi-Lattice} {of~the~Enumeration} {Degrees}},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {74--80},
     publisher = {mathdoc},
     volume = {19},
     number = {5},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2012_19_5_a7/}
}
TY  - JOUR
AU  - B. I. Solon
AU  - V. V. Tikhov
TI  - About Not Countable Ideals in a Semi-Lattice of~the~Enumeration Degrees
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2012
SP  - 74
EP  - 80
VL  - 19
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MAIS_2012_19_5_a7/
LA  - ru
ID  - MAIS_2012_19_5_a7
ER  - 
%0 Journal Article
%A B. I. Solon
%A V. V. Tikhov
%T About Not Countable Ideals in a Semi-Lattice of~the~Enumeration Degrees
%J Modelirovanie i analiz informacionnyh sistem
%D 2012
%P 74-80
%V 19
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MAIS_2012_19_5_a7/
%G ru
%F MAIS_2012_19_5_a7
B. I. Solon; V. V. Tikhov. About Not Countable Ideals in a Semi-Lattice of~the~Enumeration Degrees. Modelirovanie i analiz informacionnyh sistem, Tome 19 (2012) no. 5, pp. 74-80. http://geodesic.mathdoc.fr/item/MAIS_2012_19_5_a7/

[1] Robert I. Soare, “Recursively Enumerable Sets and Degrees”, Springer-Verlag, Berlin–Heidelberg–New York, 1987 | MR | MR | Zbl

[2] J. Case, “Enumeration reducibility and partial degrees”, Ann. Math. Logic, 2 (1970), 419–439 | DOI | MR

[3] S. B. Cooper, “Partial degrees and the density problem. Part 2: The enumeration degrees of the 2/j sets are dense”, J. Symb. Logic, 49 (1984), 503–513 | DOI | MR | Zbl

[4] K. McEvoy, “Jumps of quasi-minimal enumeration degrees”, J. Symb. Logic, 50 (1985), 839–848 | DOI | MR | Zbl

[5] E. A. Polyakov, M. G. Rozinas, Teoriya algoritmov, Uchebnoe posobie, Izd-vo IvGU, Ivanovo, 1976 | MR

[6] S. B. Cooper, A. Sorbi, X. Yi, “Cupping and noncupping in the e-degrees of sets”, Annals of Pure and Applied Logic, 82 (1997), 317–342 | DOI | MR

[7] L. Gutteridge, Some results on e-reducibility, Ph. D. Diss., Simon Fraser University, Burnaby, 1971

[8] X. Rodzhers, Teoriya vychislimykh funktsii i effektivnaya vychislimost, Mir, M., 1972