Arithmetical Sacks Forcing

by Rod Downey , Liang Yu
Venue:Archive for Mathematical Logic
Citations:3 - 0 self

Active Bibliography

The Turing degrees below generics and randoms – Richard A. Shore - 2012
32 On the Structure of Degrees of Inferability – Martin Kummer, Frank Stephan - 1993
1 Almost Weakly 2-Generic Sets – Stephen A. Fenner - 1996
1 Every 1-generic computes a properly 1-generic – Barbara F. Csima, Rod Downey, Noam Greenberg, Denis R. Hirschfeldt, Joseph, S. Miller
3 TURING DEGREES OF REALS OF POSITIVE EFFECTIVE PACKING DIMENSION – Rod Downey, Noam Greenberg
1 Superbranching degrees – Rod Downey - 1990
On minimal wtt-degrees and computably enumerable Turing degrees – Rod Downey, Reed Solomon - 2006
LOW LEVEL NONDEFINABILITY RESULTS: DOMINATION AND RECURSIVE ENUMERATION – Mingzhong Cai, Richard, A. Shore
2 Strong minimal covers and a question of Yates: the story so far – Andrew E. M. Lewis - 2006
Computability Theory, Algorithmic Randomness and Turing’s Anticipation – Rod Downey
1 Π 0 1 CLASSES AND STRONG DEGREE SPECTRA OF RELATIONS – John Chisholm, Jennifer Chubb, Valentina S. Harizanov, Denis R. Hirschfeldt, Carl G. Jockusch, Timothy Mcnicholl, Sarah Pingrey
Relatively recursively enumerable reals – Bernard A. Anderson - 2008
6 Forcing in Proof Theory – Jeremy Avigad - 2004
STRONG DEGREE SPECTRA OF RELATIONS – Sarah Pingrey, S. Harizanov - 2008
41 On the strength of Ramsey’s Theorem for pairs – Peter A. Cholak, Carl G. Jockusch, Theodore, A. Slaman - 2001
Ultrafilters with property (s) – Arnold W. Miller - 2003
BEYOND THE ARITHMETIC – unknown authors - 2005
LOWNESS FOR BOUNDED RANDOMNESS – Rod Downey, Keng, Meng Ng
1 Bounded Randomness ⋆ – Paul Brodhead, Rod Downey, Keng Meng Ng