13 results
LIMIT COMPLEXITIES, MINIMAL DESCRIPTIONS, AND $n$-RANDOMNESS
-
- Journal:
- The Journal of Symbolic Logic / Accepted manuscript
- Published online by Cambridge University Press:
- 05 June 2024, pp. 1-16
-
- Article
- Export citation
COMPUTABLY COMPACT METRIC SPACES
- Part of
-
- Journal:
- Bulletin of Symbolic Logic / Volume 29 / Issue 2 / June 2023
- Published online by Cambridge University Press:
- 11 May 2023, pp. 170-263
- Print publication:
- June 2023
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE
-
- Journal:
- The Journal of Symbolic Logic / Volume 84 / Issue 4 / December 2019
- Published online by Cambridge University Press:
- 04 November 2019, pp. 1326-1347
- Print publication:
- December 2019
-
- Article
- Export citation
On computable self-embeddings of computable linear orderings
-
- Journal:
- The Journal of Symbolic Logic / Volume 74 / Issue 4 / December 2009
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1352-1366
- Print publication:
- December 2009
-
- Article
- Export citation
The Complexity of Orbits of Computably Enumerable Sets
-
- Journal:
- Bulletin of Symbolic Logic / Volume 14 / Issue 1 / March 2008
- Published online by Cambridge University Press:
- 15 January 2014, pp. 69-87
- Print publication:
- March 2008
-
- Article
- Export citation
Schnorr dimension
-
- Journal:
- Mathematical Structures in Computer Science / Volume 16 / Issue 5 / October 2006
- Published online by Cambridge University Press:
- 11 October 2006, pp. 789-811
-
- Article
- Export citation
Some computability-theoretic aspects of reals and randomness
-
-
- Book:
- The Notre Dame Lectures
- Published online:
- 30 March 2017
- Print publication:
- 02 March 2005, pp 97-145
-
- Chapter
- Export citation
Reverse mathematics, Archimedean classes, and Hahn's Theorem
-
-
- Book:
- Reverse Mathematics 2001
- Published online:
- 31 March 2017
- Print publication:
- 02 March 2005, pp 147-163
-
- Chapter
- Export citation
Schnorr randomness
-
- Journal:
- The Journal of Symbolic Logic / Volume 69 / Issue 2 / June 2004
- Published online by Cambridge University Press:
- 12 March 2014, pp. 533-554
- Print publication:
- June 2004
-
- Article
- Export citation
Decomposition and infima in the computably enumerable degrees
-
- Journal:
- The Journal of Symbolic Logic / Volume 68 / Issue 2 / June 2003
- Published online by Cambridge University Press:
- 12 March 2014, pp. 551-579
- Print publication:
- June 2003
-
- Article
- Export citation
Contiguity and distributivity in the enumerable Turing degrees — Corrigendum
-
- Journal:
- The Journal of Symbolic Logic / Volume 67 / Issue 4 / December 2002
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1579-1580
- Print publication:
- December 2002
-
- Article
- Export citation
Contiguity and distributivity in the enumerable Turing degrees
-
- Journal:
- The Journal of Symbolic Logic / Volume 62 / Issue 4 / December 1997
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1215-1240
- Print publication:
- December 1997
-
- Article
- Export citation
Robert I. Soare. Recursively enumerable sets and degrees. A study of computable functions and computably generated sets. Perspectives in mathematical logic. Springer-Verlag, Berlin, Heidelberg, New York, etc., 1987, xviii + 437 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 55 / Issue 1 / March 1990
- Published online by Cambridge University Press:
- 12 March 2014, pp. 356-357
- Print publication:
- March 1990
-
- Article
- Export citation