论文信息 - Definability in the Turing degrees

Definability in the Turing degrees

On etend a toutes les relations denombrables le theoreme de Spector selon lequel tout ideal denombrable dans les degres de Turing ordonnes D est uniformement definissable a partir des parametres de D

Theodore A. Slaman | W. Hugh Woodin | T. Slaman | W. Woodin

[1] C. Spector. On Degrees of Recursive Unsolvability , 1956 .

[2] J. Myhill,et al. Retraceable Sets , 1958, Canadian Journal of Mathematics.

[3] R A Shore. The homogeneity conjecture. , 1979, Proceedings of the National Academy of Sciences of the United States of America.

[4] Anil Nerode,et al. Second order logic and first order theories of reducibility orderings , 1980 .

[5] Anil Nerode,et al. Reducibility orderings: Theories, definability and automorphisms☆ , 1980 .

[6] Richard A. Shore,et al. On homogeneity and definability in the first-order theory of the Turing degrees , 1982, Journal of Symbolic Logic.

[7] Carl G. Jockusch,et al. Pseudojump operators. I. The r.e. case , 1983 .

[8] Lawrence V. Welch. A Hierarchy of Families of Recursively Enumerable Degrees , 1984, J. Symb. Log..