28 results
MAXIMAL TOWERS AND ULTRAFILTER BASES IN COMPUTABILITY THEORY
- Part of
-
- Journal:
- The Journal of Symbolic Logic / Volume 88 / Issue 3 / September 2023
- Published online by Cambridge University Press:
- 15 August 2022, pp. 1170-1190
- Print publication:
- September 2023
-
- Article
- Export citation
FRAÏSSÉ LIMITS FOR RELATIONAL METRIC STRUCTURES
- Part of
-
- Journal:
- The Journal of Symbolic Logic / Volume 86 / Issue 3 / September 2021
- Published online by Cambridge University Press:
- 16 August 2021, pp. 913-934
- Print publication:
- September 2021
-
- Article
- Export citation
THE REVERSE MATHEMATICS OF THEOREMS OF JORDAN AND LEBESGUE
- Part of
-
- Journal:
- The Journal of Symbolic Logic / Volume 86 / Issue 4 / December 2021
- Published online by Cambridge University Press:
- 01 February 2021, pp. 1657-1675
- Print publication:
- December 2021
-
- Article
- Export citation
MUCHNIK DEGREES AND CARDINAL CHARACTERISTICS
- Part of
-
- Journal:
- The Journal of Symbolic Logic / Volume 86 / Issue 2 / June 2021
- Published online by Cambridge University Press:
- 04 September 2020, pp. 471-498
- Print publication:
- June 2021
-
- Article
- Export citation
RANDOMNESS NOTIONS AND REVERSE MATHEMATICS
-
- Journal:
- The Journal of Symbolic Logic / Volume 85 / Issue 1 / March 2020
- Published online by Cambridge University Press:
- 09 September 2019, pp. 271-299
- Print publication:
- March 2020
-
- Article
- Export citation
THE COMPLEXITY OF TOPOLOGICAL GROUP ISOMORPHISM
-
- Journal:
- The Journal of Symbolic Logic / Volume 83 / Issue 3 / September 2018
- Published online by Cambridge University Press:
- 23 October 2018, pp. 1190-1203
- Print publication:
- September 2018
-
- Article
- Export citation
Calibrating word problems of groups via the complexity of equivalence relations
-
- Journal:
- Mathematical Structures in Computer Science / Volume 28 / Issue 3 / March 2018
- Published online by Cambridge University Press:
- 19 October 2016, pp. 457-471
-
- Article
- Export citation
USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS
-
- Journal:
- Bulletin of Symbolic Logic / Volume 22 / Issue 3 / September 2016
- Published online by Cambridge University Press:
- 10 October 2016, pp. 305-331
- Print publication:
- September 2016
-
- Article
- Export citation
DEMUTH’S PATH TO RANDOMNESS
-
- Journal:
- Bulletin of Symbolic Logic / Volume 21 / Issue 3 / September 2015
- Published online by Cambridge University Press:
- 15 September 2015, pp. 270-305
- Print publication:
- September 2015
-
- Article
- 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
CHARACTERIZING LOWNESS FOR DEMUTH RANDOMNESS
-
- Journal:
- The Journal of Symbolic Logic / Volume 79 / Issue 2 / June 2014
- Published online by Cambridge University Press:
- 25 June 2014, pp. 526-560
- Print publication:
- June 2014
-
- Article
- Export citation
COMPUTING K-TRIVIAL SETS BY INCOMPLETE RANDOM SETS
-
- Journal:
- Bulletin of Symbolic Logic / Volume 20 / Issue 1 / March 2014
- Published online by Cambridge University Press:
- 13 May 2014, pp. 80-90
- Print publication:
- March 2014
-
- Article
- Export citation
Borel structures: a brief survey
-
-
- Book:
- Effective Mathematics of the Uncountable
- Published online:
- 05 December 2013
- Print publication:
- 31 October 2013, pp 124-134
-
- Chapter
- Export citation
Borel structures and Borel theories
-
- Journal:
- The Journal of Symbolic Logic / Volume 76 / Issue 2 / June 2011
- Published online by Cambridge University Press:
- 12 March 2014, pp. 461-476
- Print publication:
- June 2011
-
- Article
- Export citation
Benign cost functions and lowness properties
-
- Journal:
- The Journal of Symbolic Logic / Volume 76 / Issue 1 / March 2011
- Published online by Cambridge University Press:
- 12 March 2014, pp. 289-312
- Print publication:
- March 2011
-
- Article
- Export citation
Describing Groups
-
- Journal:
- Bulletin of Symbolic Logic / Volume 13 / Issue 3 / September 2007
- Published online by Cambridge University Press:
- 15 January 2014, pp. 305-339
- Print publication:
- September 2007
-
- Article
- Export citation
Randomness and Computability: Open Questions
-
- Journal:
- Bulletin of Symbolic Logic / Volume 12 / Issue 3 / September 2006
- Published online by Cambridge University Press:
- 15 January 2014, pp. 390-410
- Print publication:
- September 2006
-
- Article
- Export citation
Calibrating Randomness
-
- Journal:
- Bulletin of Symbolic Logic / Volume 12 / Issue 3 / September 2006
- Published online by Cambridge University Press:
- 15 January 2014, pp. 411-491
- Print publication:
- September 2006
-
- Article
- Export citation
Lowness and nullsets
-
- Journal:
- The Journal of Symbolic Logic / Volume 71 / Issue 3 / September 2006
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1044-1052
- Print publication:
- September 2006
-
- Article
- Export citation
Reals which compute little
-
-
- Book:
- Logic Colloquium '02
- Published online:
- 31 March 2017
- Print publication:
- 02 March 2006, pp 261-275
-
- Chapter
- Export citation