A variant of Mathias forcing that preserves ACA₀

DOI10.1007/S00153-012-0297-4MaRDI QIDQ1938403zbMATH OpenOpenAlexFDO

Authors François G. Dorais

Publication date 4 February 2013

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1110.6559

zbMATH Keywords

\({F_\sigma}\)-idealscohesive setscone avoidancegenericlower semicontinuousMathias forcingreverse mathematicssecond-order arithmeticsubmeasure

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Other aspects of forcing and Boolean-valued models (03E40) Second- and higher-order arithmetic and fragments (03F35)

Abstract: We present and analyze $F_{s}igma$-Mathias forcing, which is similar but tamer than Mathias forcing. In particular, we show that this forcing preserves certain weak subsystems of second-order arithmetic such as $mathsf{ACA}_0$ and $mathsf{WKL}_0+mathsfISigm{a}_2^0$, whereas Mathias forcing does not. We also show that the needed reals for $F_{s}igma$-Mathias forcing (in the sense of Blass) are just the computable reals, as opposed to the hyperarithmetic reals for Mathias forcing.

Review text

This paper formulates and applies \(F_\sigma\)-Mathias forcing, an adaptation of set-theoretic Mathias forcing specially devised to preserve properties of models of second-order arithmetic. For example, the author proves that if \(\mathcal N\) is a model of ACA\(_0\) and \(G\) is generic for \(F_\sigma\)-Mathias forcing, then \(\mathcal N [G]\) is also a model of ACA\(_0\). This statement also holds with ACA\(_0\) replaced by WKL\(_0\) plus induction for \(\Sigma^0_2\) formulas. The final section demonstrates the use of this forcing machinery in obtaining conservation and cone-avoidance theorems. The article supplies a conceptual bridge from the set-theoretic treatment of Mathias forcing of \textit{J. E. Baumgartner} [Lond. Math. Soc. Lect. Note Ser. 87, 1--59 (1983; Zbl 0524.03040)] and \textit{A. Blass} [Ann. Pure Appl. Logic 109, No. 1--2, 77--88 (2001; Zbl 0980.03055)] to the computability-theoretic results of \textit{P. A. Cholak} et al. [J. Symb. Log. 66, No. 1, 1--55 (2001; Zbl 0977.03033); corrigendum ibid. 74, No. 4, 1438--1439 (2009; Zbl 1182.03107)] and \textit{D. D. Dzhafarov} and \textit{C. G. Jockusch jun.} [J. Symb. Log. 74, No. 2, 557--578 (2009; Zbl 1166.03021)].

Recommendations

• Formalizing forcing arguments in subsystems of second-order arithmetic
• Forcing and reductibilities. II. Forcing in fragments of analysis
• Generics for computable Mathias forcing
• Mathias-Prikry and Laver-Prikry type forcing
• Genericity for Mathias forcing over general Turing ideals

Cites work

• A new proof that analytic sets are Ramsey
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• scientific article; zbMATH DE number 2236640 (Why is no real title available?)
• Needed reals and recursion in generic reals
• On the strength of Ramsey's theorem
• On the strength of Ramsey's theorem for pairs
• Ramsey's theorem and cone avoidance

Cited in

(4)

• Formalizing forcing arguments in subsystems of second-order arithmetic
• Mathias Forcing which does not Add Dominating Reals
• Forcing and reductibilities. II. Forcing in fragments of analysis
• Genericity for Mathias forcing over general Turing ideals

This page was built for publication: A variant of Mathias forcing that preserves \(\mathsf{ACA}_0\)

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