Boolean Algebras, Stone Spaces, and the Iterated Turing Jump
Journal of Symbolic Logic 59 (4):1121 - 1138 (1994)
| Abstract | We show, roughly speaking, that it requires ω iterations of the Turing jump to decode nontrivial information from Boolean algebras in an isomorphism invariant fashion. More precisely, if α is a recursive ordinal, A is a countable structure with finite signature, and d is a degree, we say that A has αth-jump degree d if d is the least degree which is the αth jump of some degree c such there is an isomorphic copy of A with universe ω in which the functions and relations have degree at most c. We show that every degree d ≥ 0 (ω) is the ωth jump degree of a Boolean algebra, but that for $n no Boolean algebra has nth-jump degree $\mathbf{d} > 0^{(n)}$ . The former result follows easily from work of L. Feiner. The proof of the latter result uses the forcing methods of J. Knight together with an analysis of various equivalences between Boolean algebras based on a study of their Stone spaces. A byproduct of the proof is a method for constructing Stone spaces with various prescribed properties | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,875 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesRichard A. Shore (2007). Local Definitions in Degeree Structures: The Turing Jump, Hyperdegrees and Beyond. Bulletin of Symbolic Logic 13 (2):226-239.
Theodore A. Slaman & John R. Steel (1989). Complementation in the Turing Degrees. Journal of Symbolic Logic 54 (1):160-176.
Brian A. Davey & John C. Galati (2003). A Coalgebraic View of Heyting Duality. Studia Logica 75 (3):259 - 270.
Paul Bankston (1987). Reduced Coproducts of Compact Hausdorff Spaces. Journal of Symbolic Logic 52 (2):404-424.
Guohua Wu (2006). Jump Operator and Yates Degrees. Journal of Symbolic Logic 71 (1):252 - 264.
David Miller (2009). A Refined Geometry of Logic. Principia 13 (3):339-356.
Steffen Lempp & Theodore A. Slaman (1989). A Limit on Relative Genericity in the Recursively Enumerable Sets. Journal of Symbolic Logic 54 (2):376-395.
Rod Downey & Carl G. Jockusch Jr (1999). Effective Presentability of Boolean Algebras of Cantor-Bendixson Rank. Journal of Symbolic Logic 64 (1):45-52.
Harold T. Hodes (1980). Jumping Through the Transfinite: The Master Code Hierarchy of Turing Degrees. Journal of Symbolic Logic 45 (2):204-220.
Carl G. Jockusch Jr & Robert I. Soare (1994). Boolean Algebras, Stone Spaces, and the Iterated Turing Jump. Journal of Symbolic Logic 59 (4):1121 - 1138.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
