Primitive recursion and the chain antichain principle

DOI10.1215/00294527-1715716zbMATH Open1253.03090OpenAlexW2090521688MaRDI QIDQ435242FDOQ435242

Authors: 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

Recommendations

• scientific article; zbMATH DE number 4099295
• Things that can and things that cannot be done in PRA
• Weaker cousins of Ramsey's theorem over a weak base theory
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• König's lemma, the ω-Rule and primitive recursive arithmetic

zbMATH Keywords

conservationtournamentproof miningWKLbar recursionCACchain-antichain principleErdős-Moser principle

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (14)

• Nets and reverse mathematics
• From Bolzano‐Weierstraß to Arzelà‐Ascoli
• Thin set theorems and cone avoidance
• Controlling iterated jumps of solutions to combinatorial problems
• Further applications of ultra-conservative ω-rules
• Term extraction and Ramsey's theorem for pairs
• Dominating the Erdős-Moser theorem in reverse mathematics
• Degrees bounding principles and universal instances in reverse mathematics
• Erdős-Moser and \(I \Sigma_2\)
• The proof-theoretic strength of Ramsey's theorem for pairs and two colors
• Program extraction for 2-random reals
• Separating principles below Ramsey's theorem for pairs
• Open questions about Ramsey-type statements in reverse mathematics
• A direct proof of Schwichtenberg's bar recursion closure theorem

This page was built for publication: Primitive recursion and the chain antichain principle

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