Higher Kurtz randomness

[1]  Solomon Feferman,et al.  Incompleteness along paths in progressions of theories , 1962, Journal of Symbolic Logic.

[2]  S. Feferman.  Some applications of the notions of forcing and generic sets , 1964 .

[3]  P. J. Cohen.  Set Theory and the Continuum Hypothesis , 1966 .

[4]  Tanaka Hisao.  A basis result for Π^1_1-sets of positive measure , 1967 .

[5]  G. Sacks.  Measure-theoretic uniformity in recursion theory and set theory , 1969 .

[6]  P. Martin-Löf.  On the Notion of Randomness , 1970 .

[7]  K. Kunen.  Review: Paul J. Cohen, Set Theory and the Continuum Hypothesis , 1970 .

[8]  A. Kechris.  Measure and category in effective descriptive set theory , 1973 .

[9]  G. Sacks.  Countable admissible ordinals and hyperdegrees , 1976 .

[10]  Y. Moschovakis.  Descriptive Set Theory , 1980 .

[11]  G. Sacks.  Higher recursion theory , 1990 .

[12]  Sebastiaan Terwijn,et al.  Computational randomness and lowness* , 2001, Journal of Symbolic Logic.

[13]  Stephanie Reid,et al.  On Kurtz randomness , 2004, Theor. Comput. Sci..

[14]  A. Nies,et al.  Higher Randomness Notions and Their Lowness Properties , 2007 .

[15]  A. Nies,et al.  Randomness via effective descriptive set theory , 2007 .

[16]  A. Nies,et al.  Lowness of higher randomness notions , 2008 .

[17]  Joseph S. Miller,et al.  Lowness for Kurtz randomness , 2009, The Journal of Symbolic Logic.

[18]  A. Nies.  Computability and randomness , 2009 .

[19]  Kolmogorov complexity and the Recursion Theorem , 2009, 0901.3933.