Journal of Symbolic Logic 53 (4):1070-1081 (1988)
|Abstract||We combine two techniques of set theory relating to minimal degrees of constructibility. Jensen constructed a minimal real which is additionally a Π 1 2 singleton. Groszek built an initial segment of order type 1 + α * , for any ordinal α. This paper shows how to force a Π 1 2 singleton such that the c-degrees beneath it, all represented by reals, are of type 1 + α * , for many ordinals α. We also examine the definability α needs to be so represented by a real|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
Manuel Lerman (1969). Some Nondistributive Lattices as Initial Segments of the Degrees of Unsolvability. Journal of Symbolic Logic 34 (1):85-98.
Frank P. Weber (1994). Initial Segments of the Lattice of Ideals of R.E. Degrees. Journal of Symbolic Logic 59 (4):1326-1350.
A. H. Lachlan & R. Lebeuf (1976). Countable Initial Segments of the Degrees of Unsolvability. Journal of Symbolic Logic 41 (2):289-300.
S. K. Thomason (1970). A Theorem on Initial Segments of Degrees. Journal of Symbolic Logic 35 (1):41-45.
William C. Calhoun (2006). Degrees of Monotone Complexity. Journal of Symbolic Logic 71 (4):1327 - 1341.
Richard L. Epstein (1981). Initial Segments of Degrees Below 0'. American Mathematical Society.
Ilias G. Kastanas (1988). Initial Segments of ▵12n + 1-Degrees. Journal of Symbolic Logic 53 (1):259 - 268.
C. E. M. Yates (1970). Initial Segments of the Degrees of Unsolvability Part II: Minimal Degrees. Journal of Symbolic Logic 35 (2):243-266.
Marcia Groszek (1994). Ω*1 as an Initial Segment of the C-Degrees. Journal of Symbolic Logic 59 (3):956 - 976.
Bjørn Kjos-Hanssen (2003). Local Initial Segments of the Turing Degrees. Bulletin of Symbolic Logic 9 (1):26-36.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Recent downloads (6 months)0
How can I increase my downloads?