39 results
COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS
-
- Journal:
- The Journal of Symbolic Logic / Volume 81 / Issue 3 / September 2016
- Published online by Cambridge University Press:
- 12 August 2016, pp. 1028-1046
- Print publication:
- September 2016
-
- Article
- Export citation
Diagonally Non-Computable Functions and Bi-Immunity
-
- Journal:
- The Journal of Symbolic Logic / Volume 78 / Issue 3 / September 2013
- Published online by Cambridge University Press:
- 12 March 2014, pp. 977-988
- Print publication:
- September 2013
-
- Article
- Export citation
Corrigendum to: “On the strength of Ramsey's Theorem for pairs”
-
- Journal:
- The Journal of Symbolic Logic / Volume 74 / Issue 4 / December 2009
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1438-1439
- Print publication:
- December 2009
-
- Article
- Export citation
Ramsey's theorem and cone avoidance
-
- Journal:
- The Journal of Symbolic Logic / Volume 74 / Issue 2 / June 2009
- Published online by Cambridge University Press:
- 12 March 2014, pp. 557-578
- Print publication:
- June 2009
-
- Article
- Export citation
Stability and posets
-
- Journal:
- The Journal of Symbolic Logic / Volume 74 / Issue 2 / June 2009
- Published online by Cambridge University Press:
- 12 March 2014, pp. 693-711
- Print publication:
- June 2009
-
- Article
- Export citation
Π10 classes and strong degree spectra of relations
-
- Journal:
- The Journal of Symbolic Logic / Volume 72 / Issue 3 / September 2007
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1003-1018
- Print publication:
- September 2007
-
- Article
- Export citation
Free sets and reversemathematics
-
-
- Book:
- Reverse Mathematics 2001
- Published online:
- 31 March 2017
- Print publication:
- 02 March 2005, pp 104-119
-
- Chapter
- Export citation
Generalized r-cohesiveness and the arithmetical hierarchy: a correction to “Generalized cohesiveness”
-
- Journal:
- The Journal of Symbolic Logic / Volume 67 / Issue 3 / September 2002
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1078-1082
- Print publication:
- September 2002
-
- Article
- Export citation
In Memoriam: Joseph R. Shoenfield 1927–2000
-
- Journal:
- Bulletin of Symbolic Logic / Volume 7 / Issue 3 / September 2001
- Published online by Cambridge University Press:
- 15 January 2014, pp. 393-396
- Print publication:
- September 2001
-
- Article
-
- You have access
- Export citation
Ramsey's theorem for computably enumerable colorings
-
- Journal:
- The Journal of Symbolic Logic / Volume 66 / Issue 2 / June 2001
- Published online by Cambridge University Press:
- 12 March 2014, pp. 873-880
- Print publication:
- June 2001
-
- Article
- Export citation
Richard A. Shore and Theodore A. Slaman. Defining the Turing jump. Mathematical research letters, vol. 6 (1999), pp. 711–722.
-
- Journal:
- Bulletin of Symbolic Logic / Volume 7 / Issue 1 / March 2001
- Published online by Cambridge University Press:
- 15 January 2014, pp. 73-75
- Print publication:
- March 2001
-
- Article
- Export citation
On the strength of Ramsey's theorem for pairs
-
- Journal:
- The Journal of Symbolic Logic / Volume 66 / Issue 1 / March 2001
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1-55
- Print publication:
- March 2001
-
- Article
- Export citation
2000 Annual Meeting of the Association for Symbolic Logic
-
- Journal:
- Bulletin of Symbolic Logic / Volume 6 / Issue 3 / September 2000
- Published online by Cambridge University Press:
- 15 January 2014, pp. 361-396
- Print publication:
- September 2000
-
- Article
- Export citation
Generalized cohesiveness
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 2 / June 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 489-516
- Print publication:
- June 1999
-
- Article
- Export citation
Effective presentability of Boolean algebras of Cantor-Bendixson rank 1
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 1 / March 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 45-52
- Print publication:
- March 1999
-
- Article
- Export citation
Array nonrecursive degrees and genericity
-
-
- Book:
- Computability, Enumerability, Unsolvability
- Published online:
- 23 February 2010
- Print publication:
- 11 January 1996, pp 93-104
-
- Chapter
- Export citation
Weak presentations of computable fields
-
- Journal:
- The Journal of Symbolic Logic / Volume 60 / Issue 1 / March 1995
- Published online by Cambridge University Press:
- 12 March 2014, pp. 199-208
- Print publication:
- March 1995
-
- Article
- Export citation
Boolean algebras, Stone spaces, and the iterated Turing jump
-
- Journal:
- The Journal of Symbolic Logic / Volume 59 / Issue 4 / December 1994
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1121-1138
- Print publication:
- December 1994
-
- Article
- Export citation
On the Σ2-theory of the upper semilattice of Turing degrees
-
- Journal:
- The Journal of Symbolic Logic / Volume 58 / Issue 1 / March 1993
- Published online by Cambridge University Press:
- 12 March 2014, pp. 193-204
- Print publication:
- March 1993
-
- Article
- Export citation
Weakly semirecursive sets
-
- Journal:
- The Journal of Symbolic Logic / Volume 55 / Issue 2 / June 1990
- Published online by Cambridge University Press:
- 12 March 2014, pp. 637-644
- Print publication:
- June 1990
-
- Article
- Export citation