16 results
The complexity of completions in partial combinatory algebra
-
- Journal:
- Mathematical Structures in Computer Science / Volume 34 / Issue 6 / June 2024
- Published online by Cambridge University Press:
- 23 September 2024, pp. 455-466
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
REGAININGLY APPROXIMABLE NUMBERS AND SETS
- Part of
-
- Journal:
- The Journal of Symbolic Logic , First View
- Published online by Cambridge University Press:
- 22 January 2024, pp. 1-31
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
SOME CONSEQUENCES OF ${\mathrm {TD}}$ AND ${\mathrm {sTD}}$
- Part of
-
- Journal:
- The Journal of Symbolic Logic / Volume 88 / Issue 4 / December 2023
- Published online by Cambridge University Press:
- 15 May 2023, pp. 1573-1589
- Print publication:
- December 2023
-
- Article
-
- You have access
- HTML
- Export citation
THE TURING DEGREES AND KEISLER’S ORDER
- Part of
-
- Journal:
- The Journal of Symbolic Logic / Volume 89 / Issue 1 / March 2024
- Published online by Cambridge University Press:
- 07 September 2022, pp. 331-341
- Print publication:
- March 2024
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
Towards Finding a Lattice that Characterizes the ${>}\ \omega ^2$ -Fickle Recursively Enumerable Turing Degrees
- Part of
-
- Journal:
- Bulletin of Symbolic Logic / Volume 27 / Issue 4 / December 2021
- Published online by Cambridge University Press:
- 28 February 2022, p. 528
- Print publication:
- December 2021
-
- Article
-
- You have access
- Export citation
Results on Martin’s Conjecture
- Part of
-
- Journal:
- Bulletin of Symbolic Logic / Volume 27 / Issue 2 / June 2021
- Published online by Cambridge University Press:
- 16 September 2021, pp. 219-220
- Print publication:
- June 2021
-
- Article
-
- You have access
- Export citation
1 - Key developments in algorithmic randomness
-
-
- Book:
- Algorithmic Randomness
- Published online:
- 07 May 2020
- Print publication:
- 07 May 2020, pp 1-39
-
- Chapter
- Export citation
RELATIVE DEFINABILITY OF n-GENERICS
-
- Journal:
- The Journal of Symbolic Logic / Volume 83 / Issue 4 / December 2018
- Published online by Cambridge University Press:
- 21 December 2018, pp. 1345-1362
- Print publication:
- December 2018
-
- Article
- Export citation
THE COMPUTATIONAL CONTENT OF INTRINSIC DENSITY
-
- Journal:
- The Journal of Symbolic Logic / Volume 83 / Issue 2 / June 2018
- Published online by Cambridge University Press:
- 01 August 2018, pp. 817-828
- Print publication:
- June 2018
-
- Article
- Export citation
PERMUTATIONS OF THE INTEGERS INDUCE ONLY THE TRIVIAL AUTOMORPHISM OF THE TURING DEGREES
-
- Journal:
- Bulletin of Symbolic Logic / Volume 24 / Issue 2 / June 2018
- Published online by Cambridge University Press:
- 07 August 2018, pp. 165-174
- Print publication:
- June 2018
-
- Article
- Export citation
THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES
-
- Journal:
- The Journal of Symbolic Logic / Volume 81 / Issue 3 / September 2016
- Published online by Cambridge University Press:
- 15 August 2016, pp. 997-1006
- Print publication:
- September 2016
-
- Article
- Export citation
EXACT PAIRS FOR THE IDEAL OF THE K-TRIVIAL SEQUENCES IN THE TURING DEGREES
-
- Journal:
- The Journal of Symbolic Logic / Volume 79 / Issue 3 / September 2014
- Published online by Cambridge University Press:
- 18 August 2014, pp. 676-692
- Print publication:
- September 2014
-
- Article
- Export citation
THE TURING DEGREES BELOW GENERICS AND RANDOMS
-
- Journal:
- The Journal of Symbolic Logic / Volume 79 / Issue 1 / March 2014
- Published online by Cambridge University Press:
- 17 April 2014, pp. 171-178
- Print publication:
- March 2014
-
- Article
- Export citation
Relative enumerability and 1-genericity
-
- Journal:
- The Journal of Symbolic Logic / Volume 76 / Issue 3 / September 2011
- Published online by Cambridge University Press:
- 12 March 2014, pp. 897-913
- Print publication:
- September 2011
-
- Article
- Export citation
The importance of Π1 0 classes in effective randomness
-
- Journal:
- The Journal of Symbolic Logic / Volume 75 / Issue 1 / March 2010
- Published online by Cambridge University Press:
- 12 March 2014, pp. 387-400
- Print publication:
- March 2010
-
- Article
- 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