Abstract
We have seen in Chapter 14 how we could extend models of ZFC to models in which for example CH fails—supposed we have suitable generic filters at hand. On the other hand, we have also seen in Chapter 14 that there is no way to prove that generic filters exist.
However, in order to show that for example CH is independent of ZFC we have to show that ZFC+CH as well as ZFC+¬CH has a model. In other words we are not interested in the generic filters themselves, but rather in the sentences which are true in the corresponding generic models; on the other hand, if there are no generic filters, then there are also no generic models.
The trick to avoid generic filters (over models of ZFC) is to carry out the whole forcing construction within a given model V of ZFC—or alternatively in ZFC. How this can be done will be shown in this chapter.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
William B. Easton: Powers of regular cardinals. Ann. Pure Appl. Log. 1, 139–178 (1970)
Thomas Jech: Multiple Forcing. Cambridge Tracts in Mathematics. Cambridge University Press, Cambridge (1986)
Thomas Jech: Set Theory, The Third Millennium Edition, Revised and Expanded. Springer Monographs in Mathematics. Springer, Berlin (2003)
Kenneth Kunen: Set Theory, an Introduction to Independence Proofs. Studies in Logic and the Foundations of Mathematics, vol. 102. North-Holland, Amsterdam (1983)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer-Verlag London Limited
About this chapter
Cite this chapter
Halbeisen, L.J. (2012). Proving Unprovability. In: Combinatorial Set Theory. Springer Monographs in Mathematics. Springer, London. https://doi.org/10.1007/978-1-4471-2173-2_16
Download citation
DOI: https://doi.org/10.1007/978-1-4471-2173-2_16
Publisher Name: Springer, London
Print ISBN: 978-1-4471-2172-5
Online ISBN: 978-1-4471-2173-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)