f
forcing
In set theory, a technique for enlarging models of axioms of set theory (e.g. ZFC) by adjoining new elements, often used for proving consistency and independence results
Also known as unramified forcing
- Instance of
- Part of
Overview
All data
14 statements · 29% with external sources · numbers in brackets are citations
- Discovered by
- Paul Cohen(1963)
- Defining formula
M[G]=\{\operatorname{val}(u,G)|u\in M^{(\mathbb P)}\}
On other databases
7 identifiers linking forcing across the web's reference databases