Reduction games, provability and compactness
From MaRDI portal
Publication:5055312
DOI10.1142/S021906132250009XMaRDI QIDQ5055312
Damir D. Dzhafarov, Sarah C. Reitzes, Denis R. Hirschfeldt
Publication date: 13 December 2022
Published in: Journal of Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.00907
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Closed choice and a uniform low basis theorem
- The weakness of being cohesive, thin or free in reverse mathematics
- A topological view on algebraic computation models
- \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models
- Using Ramsey's theorem once
- On the strength of Ramsey's theorem for pairs
- On uniform relationships between combinatorial problems
- Turing Computability
- STRONG REDUCTIONS BETWEEN COMBINATORIAL PRINCIPLES
- Linear extensions of partial orders and reverse mathematics
- On notions of computability-theoretic reduction between Π21 principles
- The metamathematics of Stable Ramsey’s Theorem for Pairs
- Slicing the Truth
- On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics
- The atomic model theorem and type omitting
- On Extensions of Models of Strong Fragments of Arithmetic
- On the algebraic structure of Weihrauch degrees
- CONSERVATIVITY OF ULTRAFILTERS OVER SUBSYSTEMS OF SECOND ORDER ARITHMETIC
- ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM
- ON WEIHRAUCH REDUCIBILITY AND INTUITIONISTIC REVERSE MATHEMATICS
- A note on the diamond operator
- THE CHARACTERIZATION OF WEIHRAUCH REDUCIBILITY IN SYSTEMS CONTAINING
- Weihrauch Complexity in Computable Analysis
- OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS
- Cohesive avoidance and strong reductions
- Ramsey's theorem and recursion theory
This page was built for publication: Reduction games, provability and compactness
