19 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
-
- You have access
- Export citation
NOTES ON SACKS’ SPLITTING THEOREM
- Part of
-
- Journal:
- The Journal of Symbolic Logic , First View
- Published online by Cambridge University Press:
- 26 October 2023, pp. 1-30
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
Computable soft separation axioms
-
- Journal:
- Mathematical Structures in Computer Science / Volume 33 / Issue 9 / October 2023
- Published online by Cambridge University Press:
- 12 October 2023, pp. 781-808
-
- Article
-
- You have access
- HTML
- Export citation
COMPUTABLE TOPOLOGICAL GROUPS
- Part of
-
- Journal:
- The Journal of Symbolic Logic , First View
- Published online by Cambridge University Press:
- 18 September 2023, pp. 1-33
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
ON THE C.E. DEGREES REALIZABLE IN $\Pi ^0_1$ CLASSES
- Part of
-
- Journal:
- The Journal of Symbolic Logic , First View
- Published online by Cambridge University Press:
- 24 April 2023, pp. 1-26
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
CUPPING AND JUMP CLASSES IN THE COMPUTABLY ENUMERABLE DEGREES
- Part of
-
- Journal:
- The Journal of Symbolic Logic / Volume 85 / Issue 4 / December 2020
- Published online by Cambridge University Press:
- 30 October 2020, pp. 1499-1545
- Print publication:
- December 2020
-
- Article
- Export citation
COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM
- Part of
-
- Journal:
- The Journal of Symbolic Logic / Volume 85 / Issue 4 / December 2020
- Published online by Cambridge University Press:
- 26 October 2020, pp. 1664-1686
- Print publication:
- December 2020
-
- Article
- Export citation
PUNCTUAL CATEGORICITY AND UNIVERSALITY
- Part of
-
- Journal:
- The Journal of Symbolic Logic / Volume 85 / Issue 4 / December 2020
- Published online by Cambridge University Press:
- 22 October 2020, pp. 1427-1466
- Print publication:
- December 2020
-
- Article
- Export citation
COMPUTABLE LINEAR ORDERS AND PRODUCTS
- Part of
-
- Journal:
- The Journal of Symbolic Logic / Volume 85 / Issue 2 / June 2020
- Published online by Cambridge University Press:
- 20 July 2020, pp. 605-623
- Print publication:
- June 2020
-
- Article
- Export citation
AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
-
- Journal:
- The Journal of Symbolic Logic / Volume 84 / Issue 4 / December 2019
- Published online by Cambridge University Press:
- 29 April 2019, pp. 1630-1669
- Print publication:
- December 2019
-
- Article
- Export citation
FINITARY REDUCIBILITY ON EQUIVALENCE RELATIONS
-
- Journal:
- The Journal of Symbolic Logic / Volume 81 / Issue 4 / December 2016
- Published online by Cambridge University Press:
- 01 December 2016, pp. 1225-1254
- Print publication:
- December 2016
-
- Article
-
- You have access
- Export citation
COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY
-
- Journal:
- The Journal of Symbolic Logic / Volume 79 / Issue 3 / September 2014
- Published online by Cambridge University Press:
- 18 August 2014, pp. 859-881
- Print publication:
- September 2014
-
- Article
- Export citation
ω-CHANGE RANDOMNESS AND WEAK DEMUTH RANDOMNESS
-
- Journal:
- The Journal of Symbolic Logic / Volume 79 / Issue 3 / September 2014
- Published online by Cambridge University Press:
- 18 August 2014, pp. 776-791
- Print publication:
- September 2014
-
- Article
- Export citation
UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
-
- Journal:
- The Journal of Symbolic Logic / Volume 79 / Issue 1 / March 2014
- Published online by Cambridge University Press:
- 17 April 2014, pp. 60-88
- Print publication:
- March 2014
-
- Article
- Export citation
Limits on jump inversion for strong reducibilities
-
- Journal:
- The Journal of Symbolic Logic / Volume 76 / Issue 4 / December 2011
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1287-1296
- Print publication:
- December 2011
-
- Article
- Export citation
Strengthening prompt simplicity
-
- Journal:
- The Journal of Symbolic Logic / Volume 76 / Issue 3 / September 2011
- Published online by Cambridge University Press:
- 12 March 2014, pp. 946-972
- Print publication:
- September 2011
-
- Article
- Export citation
Jump inversions inside effectively closed sets and applications to randomness
-
- Journal:
- The Journal of Symbolic Logic / Volume 76 / Issue 2 / June 2011
- Published online by Cambridge University Press:
- 12 March 2014, pp. 491-518
- Print publication:
- June 2011
-
- Article
- Export citation
The importance of Π10 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
On very high degrees
-
- Journal:
- The Journal of Symbolic Logic / Volume 73 / Issue 1 / March 2008
- Published online by Cambridge University Press:
- 12 March 2014, pp. 309-342
- Print publication:
- March 2008
-
- Article
- Export citation