Formalizing forcing arguments in subsystems of second-order arithmetic

DOI10.1016/0168-0072(96)00003-6zbMath0860.03040OpenAlexW2085905338MaRDI QIDQ2563983

Jeremy Avigad

Publication date: 26 January 1997

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(96)00003-6

zbMATH Keywords

model-theoretic forcingconservation theorem

Mathematics Subject Classification ID

Second- and higher-order arithmetic and fragments (03F35) Model-theoretic forcing (03C25)

Related Items

Proof Theory in Philosophy of Mathematics ⋮ The proof-theoretic strength of Ramsey's theorem for pairs and two colors ⋮ Strict \({\varPi^1_1}\)-reflection in bounded arithmetic ⋮ Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\) ⋮ A MARRIAGE OF BROUWER’S INTUITIONISM AND HILBERT’S FINITISM I: ARITHMETIC ⋮ Subsets coded in elementary end extensions ⋮ A Model-Theoretic Approach to Ordinal Analysis ⋮ On the strength of Ramsey's theorem for pairs ⋮ Harrington's conservation theorem redone ⋮ On mathematical instrumentalism ⋮ MARGINALIA ON A THEOREM OF WOODIN ⋮ A complexity analysis of functional interpretations ⋮ Forcing in Proof Theory ⋮ Formalizing non-standard arguments in second-order arithmetic ⋮ Interpreting Weak König’s Lemma using the Arithmetized Completeness Theorem ⋮ 10th Asian Logic Conference ⋮ Some conservation results on weak König's lemma ⋮ Saturated models of universal theories ⋮ A new model construction by making a detour via intuitionistic theories. III: Ultrafinitistic proofs of conservations of \(\Sigma_1^1\) collection

Cites Work

• Fragments of arithmetic
• Herbrand analyses
• The Baire category theorem in weak subsystems of second-order arithmetic
• Recursively enumerable sets and degrees
• On the strength of König's duality theorem for countable bipartite graphs
• ∏ 0 1 Classes and Degrees of Theories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item