Access to the full content is only available to members of institutions that have purchased access. If you belong to such an institution, please log in or find out more about how to order.


Print

Contents

DOI
10.4324/9780415249126-Y078-1
DOI: 10.4324/9780415249126-Y078-1
Version: v1,  Published online: 1998
Retrieved April 16, 2024, from https://www.rep.routledge.com/articles/thematic/forcing/v-1

Article Summary

The method of forcing was introduced by Paul J. Cohen in order to prove the independence of the axiom of choice (AC) from the basic (ZF) axioms of set theory, and of the continuum hypothesis (CH) from the accepted axioms (ZFC = ZF + AC) of set theory (see set theory, axiom of choice, continuum hypothesis). Given a model M of ZF and a certain P∈M, it produces a ‘generic’ G⊆P and a model N of ZF with M⊆N and G∈N. By suitably choosing P, N can be ‘forced’ to be or not be a model of various hypotheses, which are thus shown to be consistent with or independent of the axioms. This method of proving undecidability has been very widely applied. The method has also motivated the proposal of new so-called forcing axioms to decide what is otherwise undecidable, the most important being that called Martin’s axiom (MA).

Print
Citing this article:
Burgess, John P.. Forcing, 1998, doi:10.4324/9780415249126-Y078-1. Routledge Encyclopedia of Philosophy, Taylor and Francis, https://www.rep.routledge.com/articles/thematic/forcing/v-1.
Copyright © 1998-2024 Routledge.

Related Searches

Topics