Reals n-Generic Relative to Some Perfect Tree

Journal of Symbolic Logic 73 (2):401 - 411 (2008)
  Copy   BIBTEX

Abstract

We say that a real X is n-generic relative to a perfect tree T if X is a path through T and for all $\Sigma _{n}^{0}(T)$ sets S, there exists a number k such that either X|k ∈ S or for all σ ∈ T extending X|k we have σ ∉ S. A real X is n-generic relative to some perfect tree if there exists such a T. We first show that for every number n all but countably many reals are n-generic relative to some perfect tree. Second, we show that proving this statement requires ZFC− + "∃ infinitely many iterates of the power set of ω". Third, we prove that every finite iterate of the hyperjump. ${\cal O}^{(n)}$ , is not 2-generic relative to any perfect tree and for every ordinal α below the least λ such that supβ<i (βth admissible) = λ, the iterated hyperjump ${\cal O}^{(\alpha)}$ is not 5-generic relative to any perfect tree. Finally, we demonstrate some necessary conditions for reals to be 1-generic relative to some perfect tree

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Subclasses of the Weakly Random Reals.Johanna N. Y. Franklin - 2010 - Notre Dame Journal of Formal Logic 51 (4):417-426.
On non-wellfounded iterations of the perfect set forcing.Vladimir Kanovei - 1999 - Journal of Symbolic Logic 64 (2):551-574.
Mapping a set of reals onto the reals.Arnold W. Miller - 1983 - Journal of Symbolic Logic 48 (3):575-584.
Relative Randomness and Real Closed Fields.Alexander Raichev - 2005 - Journal of Symbolic Logic 70 (1):319 - 330.
Relative Randomness and Cardinality.George Barmpalias - 2010 - Notre Dame Journal of Formal Logic 51 (2):195-205.
Coding with ladders a well ordering of the reals.Uri Abraham & Saharon Shelah - 2002 - Journal of Symbolic Logic 67 (2):579-597.
Cohen reals from small forcings.Janusz Pawlikowski - 2001 - Journal of Symbolic Logic 66 (1):318-324.
Recursive in a generic real.Juichi Shinoda & Theodore A. Slaman - 2000 - Journal of Symbolic Logic 65 (1):164-172.
Generic trees.Otmar Spinas - 1995 - Journal of Symbolic Logic 60 (3):705-726.

Analytics

Added to PP
2010-08-24

Downloads
32 (#488,786)

6 months
12 (#202,587)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Degrees That Are Not Degrees of Categoricity.Bernard Anderson & Barbara Csima - 2016 - Notre Dame Journal of Formal Logic 57 (3):389-398.

Add more citations

References found in this work

Double Jumps of Minimal Degrees.Carl G. Jockusch & David B. Posner - 1978 - Journal of Symbolic Logic 43 (4):715 - 724.
A note on the hyperarithmetical hierarchy.H. B. Enderton & Hilary Putnam - 1970 - Journal of Symbolic Logic 35 (3):429-430.

Add more references