Reverse Mathematics: The Playground of Logic

DOI10.2178/bsl/1286284559zbMath1218.03006OpenAlexW2071956244MaRDI QIDQ3163663

Richard A. Shore

Publication date: 26 October 2010

Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/bsl/1286284559

zbMATH Keywords

survey paperreverse mathematics

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30)

Related Items (8)

Term extraction and Ramsey's theorem for pairs ⋮ On the strength of the finite intersection principle ⋮ Infinite dimensional proper subspaces of computable vector spaces ⋮ ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS ⋮ Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem ⋮ A NOTE ON THE REVERSE MATHEMATICS OF THE SORITES ⋮ The limits of determinacy in second order arithmetic: consistency and complexity strength ⋮ THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak axioms of determinacy and subsystems of analysis. II \((\Sigma ^ 0_ 2\) games)
• The polarized Ramsey's theorem
• Reverse mathematics and well-ordering principles: a pilot study
• On Fraïssé's conjecture for linear orders of finite Hausdorff rank
• Matching theory
• On the strength of König's duality theorem for infinite bipartite graphs
• Borel determinacy
• Computations in higher types
• Defining the Turing jump
• On the strength of Ramsey's theorem for pairs
• A Δ₂⁰ set with no infinite low subset in either it or its complement
• Weak axioms of determinacy and subsystems of analysis I: δ20 games
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• Non-standard analysis in ACA0 and Riemann mapping theorem
• DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP
• The atomic model theorem and type omitting
• Forcing with tagged trees
• On the strength of König's duality theorem for countable bipartite graphs
• Infinite games in the Cantor space and subsystems of second order arithmetic
• Δ₃^O-determinacy, comprehension and induction
• Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
• INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
• Higher set theory and mathematical practice
• Class groups of integral group rings
• On suborderings of the α-recursively enumerable α-degrees

This page was built for publication: Reverse Mathematics: The Playground of Logic