Definable relations in Turing degree structures
-
Published:2014-02
Issue:2
Volume:58
Page:64-67
-
ISSN:1066-369X
-
Container-title:Russian Mathematics
-
language:en
-
Short-container-title:Russ Math.
Subject
General Mathematics
Reference10 articles.
1. P. Cholak, Automorphisms of the Lattice of Recursively Enumerable Sets (Mem. Amer. Math. Soc., 1995), Vol. 541.
2. L. Harrington and R. I. Soare, “The Δ 3 0 -Automorphism Method and Noninvariant Classes of Degrees,” J. Amer. Math. Soc. 9, 617–666 (1996).
3. P. Cholak and L. Harrington, “On the Definability of the Double Jump in the Computably Enumerable Sets,” J.Math. Logic 2, 261–296 (2002).
4. D. A. Martin, “Classes of Recursively Enumerable Sets and Degrees of Unsolvability,” Z. Math. Logik Grundl. Math. 12, 295–310 (1966).
5. R. Epstein, “The Nonlow Computably Enumerable Degrees are Not Definable in E,” Trans. Amer. Math. Soc. 365, 1305–1345 (2013).