31 results
IN MEMORIAM: GERALD E. SACKS, 1933–2019
-
- Journal:
- Bulletin of Symbolic Logic / Volume 28 / Issue 1 / March 2022
- Published online by Cambridge University Press:
- 31 March 2022, pp. 150-155
- Print publication:
- March 2022
-
- Article
-
- You have access
- HTML
- Export citation
THE STRENGTH OF RAMSEY’S THEOREM FOR PAIRS AND ARBITRARILY MANY COLORS
-
- Journal:
- The Journal of Symbolic Logic / Volume 83 / Issue 4 / December 2018
- Published online by Cambridge University Press:
- 21 December 2018, pp. 1610-1617
- Print publication:
- December 2018
-
- Article
- Export citation
Recursion theoretic papers. Introduction to Part VI
- from PART VI - RECURSION THEORY
-
-
- Book:
- Ordinal Definability and Recursion Theory
- Published online:
- 05 December 2015
- Print publication:
- 11 January 2016, pp 349-354
-
- Chapter
- Export citation
Martin's conjecture, arithmetic equivalence, and countable Borel equivalence relations
- from PART VI - RECURSION THEORY
-
-
- Book:
- Ordinal Definability and Recursion Theory
- Published online:
- 05 December 2015
- Print publication:
- 11 January 2016, pp 493-520
-
- Chapter
- Export citation
Definable functions on degrees
- from PART VI - RECURSION THEORY
-
-
- Book:
- Ordinal Definability and Recursion Theory
- Published online:
- 05 December 2015
- Print publication:
- 11 January 2016, pp 458-475
-
- Chapter
- Export citation
A NOTE ON INITIAL SEGMENTS OF THE ENUMERATION DEGREES
-
- Journal:
- The Journal of Symbolic Logic / Volume 79 / Issue 2 / June 2014
- Published online by Cambridge University Press:
- 25 June 2014, pp. 633-643
- Print publication:
- June 2014
-
- Article
- Export citation
Random reals, the rainbow Ramsey theorem, and arithmetic conservation
-
- Journal:
- The Journal of Symbolic Logic / Volume 78 / Issue 1 / March 2013
- Published online by Cambridge University Press:
- 12 March 2014, pp. 195-206
- Print publication:
- March 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
Low upper bounds of ideals
-
- Journal:
- The Journal of Symbolic Logic / Volume 74 / Issue 2 / June 2009
- Published online by Cambridge University Press:
- 12 March 2014, pp. 517-534
- Print publication:
- June 2009
-
- Article
- Export citation
The theory of is undecidable
- from RESEARCH ARTICLES
-
-
- Book:
- Logic Colloquium '03
- Published online:
- 30 March 2017
- Print publication:
- 02 March 2006, pp 326-344
-
- Chapter
- Export citation
Aspects of the Turing jump
- from ARTICLES
-
-
- Book:
- Logic Colloquium 2000
- Published online:
- 27 June 2017
- Print publication:
- 02 March 2005, pp 365-382
-
- Chapter
- Export citation
Comparing DNR and WWKL
-
- Journal:
- The Journal of Symbolic Logic / Volume 69 / Issue 4 / December 2004
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1089-1104
- Print publication:
- December 2004
-
- Article
- Export citation
An almost deep degree
-
- Journal:
- The Journal of Symbolic Logic / Volume 66 / Issue 2 / June 2001
- Published online by Cambridge University Press:
- 12 March 2014, pp. 881-901
- Print publication:
- June 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
EVERY SET HAS A LEAST JUMP ENUMERATION
-
- Journal:
- Journal of the London Mathematical Society / Volume 62 / Issue 3 / December 2000
- Published online by Cambridge University Press:
- 13 February 2001, pp. 641-649
- Print publication:
- December 2000
-
- Article
- Export citation
Recursive in a generic real
-
- Journal:
- The Journal of Symbolic Logic / Volume 65 / Issue 1 / March 2000
- Published online by Cambridge University Press:
- 12 March 2014, pp. 164-172
- Print publication:
- March 2000
-
- Article
- Export citation
A Basis Theorem for Perfect Sets
-
- Journal:
- Bulletin of Symbolic Logic / Volume 4 / Issue 2 / June 1998
- Published online by Cambridge University Press:
- 15 January 2014, pp. 204-209
- Print publication:
- June 1998
-
- Article
- Export citation
Relative enumerability in the difference hierarchy
-
- Journal:
- The Journal of Symbolic Logic / Volume 63 / Issue 2 / June 1998
- Published online by Cambridge University Press:
- 12 March 2014, pp. 411-420
- Print publication:
- June 1998
-
- Article
- Export citation
The Π20 enumeration degrees are not dense
-
- Journal:
- The Journal of Symbolic Logic / Volume 61 / Issue 4 / December 1996
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1364-1379
- Print publication:
- December 1996
-
- Article
- Export citation
Definability in the Recursively Enumerable Degrees
-
- Journal:
- Bulletin of Symbolic Logic / Volume 2 / Issue 4 / December 1996
- Published online by Cambridge University Press:
- 15 January 2014, pp. 392-404
- Print publication:
- December 1996
-
- Article
- Export citation