Primitive recursion and the chain antichain principle

DOI10.1215/00294527-1715716zbMath1253.03090OpenAlexW2090521688MaRDI QIDQ435242

Alexander P. Kreuzer

Publication date: 11 July 2012

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.ndjfl/1336588253

zbMATH Keywords

tournamentconservationWKLproof miningbar recursionCACchain-antichain principleErdős-Moser principle

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Functionals in proof theory (03F10) Second- and higher-order arithmetic and fragments (03F35)

Related Items

The proof-theoretic strength of Ramsey's theorem for pairs and two colors ⋮ Term extraction and Ramsey's theorem for pairs ⋮ Dominating the Erdős-Moser theorem in reverse mathematics ⋮ Program extraction for 2-random reals ⋮ OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS ⋮ Controlling iterated jumps of solutions to combinatorial problems ⋮ Degrees bounding principles and universal instances in reverse mathematics ⋮ A DIRECT PROOF OF SCHWICHTENBERG’S BAR RECURSION CLOSURE THEOREM ⋮ SEPARATING PRINCIPLES BELOW RAMSEY'S THEOREM FOR PAIRS ⋮ Thin set theorems and cone avoidance ⋮ Nets and reverse mathematics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
• Elimination of Skolem functions for monotone formulas in analysis
• Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals
• The strength of infinitary Ramseyan principles can be accessed by their densities
• Extensional Gödel functional interpretation. A consistency proof of classical analysis
• On the strength of Ramsey's theorem for pairs
• A Δ₂⁰ set with no infinite low subset in either it or its complement
• Sharp Thresholds for a Phase Transition Related to Weakly Increasing Sequences
• Term extraction and Ramsey's theorem for pairs
• The cohesive principle and the Bolzano-Weierstraß principle
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• Phase Transitions for Weakly Increasing Sequences
• Strongly majorizable functionals of finite type: A model for barrecursion containing discontinuous functionals
• Ordinal analysis of terms of finite type
• Ordinal analysis of simple cases of bar recursion
• Effective bounds from ineffective proofs in analysis: An application of functional interpretation and majorization
• Applied Proof Theory: Proof Interpretations and Their Use in Mathematics