摘要

We present and analyze -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 and , whereas Mathias forcing does not. We also show that the needed reals for -Mathias forcing (in the sense of Blass in Ann Pure Appl Logic 109(1-2):77-88, 2001) are just the computable reals, as opposed to the hyperarithmetic reals for Mathias forcing.

  • 出版日期2012-11