5 results
THE STRENGTH OF AN AXIOM OF FINITE CHOICE FOR BRANCHES IN TREES
 Part of

 Journal:
 The Journal of Symbolic Logic / Volume 88 / Issue 4 / December 2023
 Published online by Cambridge University Press:
 14 June 2023, pp. 13671386
 Print publication:
 December 2023

 Article

 You have access
 Open access
 HTML
 Export citation
PA RELATIVE TO AN ENUMERATION ORACLE
 Part of

 Journal:
 The Journal of Symbolic Logic / Volume 88 / Issue 4 / December 2023
 Published online by Cambridge University Press:
 18 July 2022, pp. 14971525
 Print publication:
 December 2023

 Article
 Export citation
THEOREMS OF HYPERARITHMETIC ANALYSIS AND ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS
 Part of

 Journal:
 Bulletin of Symbolic Logic / Volume 28 / Issue 1 / March 2022
 Published online by Cambridge University Press:
 31 March 2022, pp. 133149
 Print publication:
 March 2022

 Article

 You have access
 Open access
 HTML
 Export citation
FINDING DESCENDING SEQUENCES THROUGH ILLFOUNDED LINEAR ORDERS
 Part of

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

 Article
 Export citation
Measuring the Relative Complexity of Mathematical Constructions and Theorems

 Journal:
 Bulletin of Symbolic Logic / Volume 25 / Issue 4 / December 2019
 Published online by Cambridge University Press:
 13 February 2020, pp. 447448
 Print publication:
 December 2019

 Article

 You have access
 Export citation