Abstract
We present a series of axioms that describe the combinatorial core of the Mathias model (countable support iteration of ω2 Mathias reals over the Continuum Hypothesis). Our axioms are formulated in terms of games with Borel sets and functions and are strong enough to imply most of the propositions usually proved by means of the iterated Mathias forcing.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
