In mathematics, ramified forcing is the original form of forcing introduced by Cohen (1963). Ramified forcing starts with a model M of V = L, and builds up a larger model M[G] of Zermelo–Fraenkel set theory by adding a generic subset G of a poset to M, by imitating Kurt Gödel's constructible hierarchy.
| Property | Value |
|---|
| dbpprop:abstract
|
- In mathematics, ramified forcing is the original form of forcing introduced by Cohen (1963). Ramified forcing starts with a model M of V = L, and builds up a larger model M[G] of Zermelo–Fraenkel set theory by adding a generic subset G of a poset to M, by imitating Kurt Gödel's constructible hierarchy. Dana Scott and Robert Solovay realized that the use of constructible sets was an unnecessary complication, and could be replaced by a simpler construction similar to John von Neumann's construction of the universe as a union of sets R(&alpha) for ordinals α. (This simplification was originally called "unramified forcing", but is now usually just called "forcing". ) As a result, ramified forcing is only rarely used.
|
| dbpprop:harvtxtProperty
| |
| dbpprop:relatedInstance
| |
| dbpprop:wikiPageUsesTemplate
| |
| rdfs:comment
|
- In mathematics, ramified forcing is the original form of forcing introduced by Cohen (1963). Ramified forcing starts with a model M of V = L, and builds up a larger model M[G] of Zermelo–Fraenkel set theory by adding a generic subset G of a poset to M, by imitating Kurt Gödel's constructible hierarchy.
|
| rdfs:label
| |
| owl:sameAs
| |
| skos:subject
| |
| foaf:page
| |
![[RDF Data]](/statics/sw-cube.png)
