Abstract
We give an introduction to the theory of forcing which was invented by P. Cohen.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
“\(\vdash \)” will be used as a symbol for this purpose only temporarily, until p. 97.
- 2.
Here, \(M[G]\) is “\(M[G]\) as computed inside \((N;E)\).”
- 3.
If \(\alpha \) is an ordinal and \(X\) is any set or class, then we write \({}^{<\alpha } X\) for \(\bigcup _{\xi <\alpha } \, {}^\xi X\).
- 4.
In what follows, we use ordinal arithmetic.
- 5.
i.e., a homomorphism to itself.
- 6.
We may assume without loss of generality that such a \(G\) exists, as otherwise we might work with the transitive collapse of a countable (sufficiently) elementary substructure of \(M\).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Schindler, R. (2014). Forcing. In: Set Theory. Universitext. Springer, Cham. https://doi.org/10.1007/978-3-319-06725-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-06725-4_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06724-7
Online ISBN: 978-3-319-06725-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)