Almost everywhere domination
Journal of Symbolic Logic 69 (3):914-922 (2004)
| Abstract | A Turing degree a is said to be almost everywhere dominating if, for almost all $X \in 2^{\omega}$ with respect to the "fair coin" probability measure on $2^{\omega}$ , and for all g: $\omega \rightarrow \omega$ Turing reducible to X, there exists f: $\omega \rightarrow \omega$ of Turing degree a which dominates g. We study the problem of characterizing the almost everywhere dominating Turing degrees and other, similarly defined classes of Turing degrees. We relate this problem to some questions in the reverse mathematics of measure theory | |||||||||
| 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,705 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesCarl G. Jockusch & Tamara J. Lakins (2002). Generalized R-Cohesiveness and the Arithmetical Hierarchy: A Correction to "Generalized Cohesiveness". Journal of Symbolic Logic 67 (3):1078 - 1082.
Carl G. Jockusch Jr & Tamara J. Lakins (2002). Generalized R-Cohesiveness and the Arithmetical Hierarchy: A Correction to "Generalized Cohesiveness". Journal of Symbolic Logic 67 (3):1078 - 1082.
Jean A. Larson (2000). An Ordinal Partition Avoiding Pentagrams. Journal of Symbolic Logic 65 (3):969-978.
Carl G. Jockusch Jr & Tamara J. Lakins (2002). Generalized R-Cohesiveness and the Arithmetical Hierarchy: A Correction to "Generalized Cohesiveness". Journal of Symbolic Logic 67 (3):1078 - 1082.
Joseph S. Miller (2004). Degrees of Unsolvability of Continuous Functions. Journal of Symbolic Logic 69 (2):555 - 584.
Kenshi Miyabe (2010). An Extension of van Lambalgen's Theorem to Infinitely Many Relative 1-Random Reals. Notre Dame Journal of Formal Logic 51 (3):337-349.
Peter Clote (1986). A Generalization of the Limit Lemma and Clopen Games. Journal of Symbolic Logic 51 (2):273-291.
Andreas Weiermann (1993). Bounds for the Closure Ordinals of Essentially Monotonic Increasing Functions. Journal of Symbolic Logic 58 (2):664-671.
Stephen G. Simpson (2005). Mass Problems and Randomness. Bulletin of Symbolic Logic 11 (1):1-27.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-02-05Total downloads1 ( #274,982 of 549,198 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
