29 results
ITERATED PRIORITY ARGUMENTS IN DESCRIPTIVE SET THEORY

 Journal:
 Bulletin of Symbolic Logic / Accepted manuscript
 Published online by Cambridge University Press:
 07 April 2024, pp. 123

 Article

 You have access
 Export citation
SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
 Part of

 Journal:
 The Journal of Symbolic Logic / Volume 86 / Issue 4 / December 2021
 Published online by Cambridge University Press:
 01 February 2021, pp. 17061720
 Print publication:
 December 2021

 Article
 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. 14991545
 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. 14271466
 Print publication:
 December 2020

 Article
 Export citation
RELATIONSHIPS BETWEEN COMPUTABILITYTHEORETIC PROPERTIES OF PROBLEMS
 Part of

 Journal:
 The Journal of Symbolic Logic / Volume 87 / Issue 1 / March 2022
 Published online by Cambridge University Press:
 05 October 2020, pp. 4771
 Print publication:
 March 2022

 Article
 Export citation
STRONG JUMPTRACEABILITY

 Journal:
 Bulletin of Symbolic Logic / Volume 24 / Issue 2 / June 2018
 Published online by Cambridge University Press:
 07 August 2018, pp. 147164
 Print publication:
 June 2018

 Article
 Export citation
UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES

 Journal:
 The Journal of Symbolic Logic / Volume 83 / Issue 2 / June 2018
 Published online by Cambridge University Press:
 01 August 2018, pp. 529550
 Print publication:
 June 2018

 Article
 Export citation
A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES

 Journal:
 Bulletin of Symbolic Logic / Volume 24 / Issue 1 / March 2018
 Published online by Cambridge University Press:
 26 April 2018, pp. 5389
 Print publication:
 March 2018

 Article
 Export citation
HIGHER RANDOMNESS AND GENERICITY
 Part of

 Journal:
 Forum of Mathematics, Sigma / Volume 5 / 2017
 Published online by Cambridge University Press:
 10 December 2017, e31

 Article

 You have access
 Open access
 Export citation
DNR AND INCOMPARABLE TURING DEGREES
 Part of

 Journal:
 Forum of Mathematics, Sigma / Volume 4 / 2016
 Published online by Cambridge University Press:
 06 April 2016, e7

 Article

 You have access
 Open access
 Export citation
The finite intersection principle and genericity

 Journal:
 Mathematical Proceedings of the Cambridge Philosophical Society / Volume 160 / Issue 2 / March 2016
 Published online by Cambridge University Press:
 26 November 2015, pp. 279297
 Print publication:
 March 2016

 Article
 Export citation
COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY

 Journal:
 The Journal of Symbolic Logic / Volume 80 / Issue 1 / March 2015
 Published online by Cambridge University Press:
 13 March 2015, pp. 116144
 Print publication:
 March 2015

 Article
 Export citation
COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA

 Journal:
 The Journal of Symbolic Logic / Volume 80 / Issue 1 / March 2015
 Published online by Cambridge University Press:
 13 March 2015, pp. 145178
 Print publication:
 March 2015

 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. 526560
 Print publication:
 June 2014

 Article
 Export citation
COMPUTING KTRIVIAL 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. 8090
 Print publication:
 March 2014

 Article
 Export citation
AntiComplex Sets and Reducibilities with Tiny Use

 Journal:
 The Journal of Symbolic Logic / Volume 78 / Issue 4 / December 2013
 Published online by Cambridge University Press:
 12 March 2014, pp. 13071327
 Print publication:
 December 2013

 Article
 Export citation
Frontmatter

 Book:
 Effective Mathematics of the Uncountable
 Published online:
 05 December 2013
 Print publication:
 31 October 2013, pp iiv

 Chapter
 Export citation
Contents

 Book:
 Effective Mathematics of the Uncountable
 Published online:
 05 December 2013
 Print publication:
 31 October 2013, pp vvi

 Chapter
 Export citation
Computable structure theory using admissible recursion theory on ω1 using admissibility


 Book:
 Effective Mathematics of the Uncountable
 Published online:
 05 December 2013
 Print publication:
 31 October 2013, pp 5080

 Chapter
 Export citation
Introduction

 Book:
 Effective Mathematics of the Uncountable
 Published online:
 05 December 2013
 Print publication:
 31 October 2013, pp 113

 Chapter
 Export citation