Reduction games, provability and compactness

DOI10.1142/S021906132250009XMaRDI QIDQ5055312zbMATH OpenFDO

Authors Damir D. Dzhafarov, Denis R. Hirschfeldt, Sarah C. Reitzes

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

zbMATH Keywords

computable reducibilityRamsey's theoremreduction gamesreverse mathematicsweihrauch reducibility

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Recommendations

• On notions of computability-theoretic reduction between Π21 principles
• Parallel strategies
• scientific article; zbMATH DE number 5038466
• The determinacy strength of \(\Pi_2^1\)-comprehension
• Games with 1-backtracking

Cites work

• \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models
• A note on the diamond operator
• A topological view on algebraic computation models
• Closed choice and a uniform low basis theorem
• Cohesive avoidance and strong reductions
• Conservativity of ultrafilters over subsystems of second order arithmetic
• scientific article; zbMATH DE number 1226875 (Why is no real title available?)
• scientific article; zbMATH DE number 873158 (Why is no real title available?)
• scientific article; zbMATH DE number 7577584 (Why is no real title available?)
• scientific article; zbMATH DE number 227056 (Why is no real title available?)
• Linear extensions of partial orders and reverse mathematics
• On Extensions of Models of Strong Fragments of Arithmetic
• On notions of computability-theoretic reduction between Π21 principles
• On the algebraic structure of Weihrauch degrees
• On the role of the collection principle for \(\Sigma ^0_2\)-formulas in second-order reverse mathematics
• On the strength of Ramsey's theorem for pairs
• On the uniform computational content of Ramsey's theorem
• On uniform relationships between combinatorial problems
• On Weihrauch reducibility and intuitionistic reverse mathematics
• Open questions about Ramsey-type statements in reverse mathematics
• Ramsey's theorem and recursion theory
• Slicing the truth. On the computable and reverse mathematics of combinatorial principles
• Strong reductions between combinatorial principles
• Subsystems of second order arithmetic
• The atomic model theorem and type omitting
• THE CHARACTERIZATION OF WEIHRAUCH REDUCIBILITY IN SYSTEMS CONTAINING
• The metamathematics of Stable Ramsey’s Theorem for Pairs
• The weakness of being cohesive, thin or free in reverse mathematics
• Turing computability. Theory and applications
• Using Ramsey's theorem once
• Weihrauch Complexity in Computable Analysis
• Weihrauch-completeness for layerwise computability

Cited in

(5)

• Dual reduction and elementary games
• Lawvere-Tierney topologies for computability theorists
• Reduction games, provability, and compactness
• The Ginsburg-Sands theorem and computability theory
• The reverse mathematics of \textsf{CAC for trees}

This page was built for publication: Reduction games, provability and compactness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055312)