Skip to main content Accessibility help
×
Hostname: page-component-586b7cd67f-t7czq Total loading time: 0 Render date: 2024-11-26T02:23:07.299Z Has data issue: false hasContentIssue false

VIII - Forcing

Published online by Cambridge University Press:  12 January 2010

George Tourlakis
Affiliation:
York University, Toronto
Get access

Summary

The method of forcing was invented by Cohen (1963) towards the construction of non-standard models of ZFC, so that “new axioms” could be proved consistent with the standard ones. Our retelling of the basics of forcing found in this chapter is indebted primarily to the user-friendly account found in Shoenfield (1971). The influence of the expositions in Burgess (1978), Jech (1978b), and Kunen (1980) should also be evident.

In outline, the method goes like this: Suppose we want to show that ZFC (sometimes ZF or an even weaker subtheory) is consistent with some weird new axiom, “NA”. Working in the metatheory, one starts with a CTM, M, for ZFC. This is the ground model. One then judiciously chooses a PO set, 〈P, <, 1〉, in M – where we find it convenient to restrict attention to PO sets that have a maximum element (let us call the latter “1”) – and, using the PO set, one constructs a so-called generic set G. Circumstances normally have G obey GM. The “judicious” aspect of the choice of the PO set will entail that the generic extension, M[G], of the CTM M not only contains G as an element but is a CTM itself that satisfies NA as well (i.e., ⊨M[G] ZFC+NA). Thus, one has a proof in the metatheory that if ZFC is consistent (i.e., if a CTM for ZFC exists), then so is ZFC + NA.

We have said above that “〈P,<, 1〉 ∈ M”. By absoluteness of pair (see Section VI.8), the quoted statement is equivalent to “PM and<∈ M and 1 ∈ M”.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Forcing
  • George Tourlakis, York University, Toronto
  • Book: Lectures in Logic and Set Theory
  • Online publication: 12 January 2010
  • Chapter DOI: https://doi.org/10.1017/CBO9780511615566.009
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Forcing
  • George Tourlakis, York University, Toronto
  • Book: Lectures in Logic and Set Theory
  • Online publication: 12 January 2010
  • Chapter DOI: https://doi.org/10.1017/CBO9780511615566.009
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Forcing
  • George Tourlakis, York University, Toronto
  • Book: Lectures in Logic and Set Theory
  • Online publication: 12 January 2010
  • Chapter DOI: https://doi.org/10.1017/CBO9780511615566.009
Available formats
×