11 results
(EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE
- Part of
-
- Journal:
- The Journal of Symbolic Logic / Volume 89 / Issue 1 / March 2024
- Published online by Cambridge University Press:
- 29 December 2022, pp. 262-307
- Print publication:
- March 2024
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
A PREDICATIVE VARIANT OF HYLAND’S EFFECTIVE TOPOS
- Part of
-
- Journal:
- The Journal of Symbolic Logic / Volume 86 / Issue 2 / June 2021
- Published online by Cambridge University Press:
- 22 October 2020, pp. 433-447
- Print publication:
- June 2021
-
- Article
- Export citation
COMPUTABILITY IN UNCOUNTABLE BINARY TREES
-
- Journal:
- The Journal of Symbolic Logic / Volume 84 / Issue 3 / September 2019
- Published online by Cambridge University Press:
- 12 March 2019, pp. 1049-1098
- Print publication:
- September 2019
-
- Article
- Export citation
ON THE DECIDABILITY OF THE ${{\rm{\Sigma }}_2}$ THEORIES OF THE ARITHMETIC AND HYPERARITHMETIC DEGREES AS UPPERSEMILATTICES
-
- Journal:
- The Journal of Symbolic Logic / Volume 82 / Issue 4 / December 2017
- Published online by Cambridge University Press:
- 09 January 2018, pp. 1496-1518
- Print publication:
- December 2017
-
- 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
THE GENERIC DEGREES OF DENSITY-1 SETS, AND A CHARACTERIZATION OF THE HYPERARITHMETIC REALS
-
- Journal:
- The Journal of Symbolic Logic / Volume 80 / Issue 4 / December 2015
- Published online by Cambridge University Press:
- 22 December 2015, pp. 1290-1314
- Print publication:
- December 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
RT22 does not imply WKL0
-
- Journal:
- The Journal of Symbolic Logic / Volume 77 / Issue 2 / June 2012
- Published online by Cambridge University Press:
- 12 March 2014, pp. 609-620
- Print publication:
- June 2012
-
- Article
-
- You have access
- Export citation
Complex tilings
-
- Journal:
- The Journal of Symbolic Logic / Volume 73 / Issue 2 / June 2008
- Published online by Cambridge University Press:
- 12 March 2014, pp. 593-613
- Print publication:
- June 2008
-
- Article
- Export citation
On the strength of Ramsey's theorem for pairs
-
- Journal:
- The Journal of Symbolic Logic / Volume 66 / Issue 1 / March 2001
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1-55
- Print publication:
- March 2001
-
- Article
- Export citation
Planarity and minimal path algorithms
- Part of
-
- Journal:
- Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics / Volume 40 / Issue 1 / February 1986
- Published online by Cambridge University Press:
- 09 April 2009, pp. 131-142
- Print publication:
- February 1986
-
- Article
-
- You have access
- Export citation