Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

About: Ramified forcing

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In the mathematical discipline of set theory, ramified forcing is the original form of forcing introduced by to prove the independence of the continuum hypothesis from Zermelo–Fraenkel set theory. Ramified forcing starts with a model M of set theory in which the axiom of constructibility, V = L, holds, and then builds up a larger model M[G] of Zermelo–Fraenkel set theory by adding a generic subset G of a partially ordered set to M, imitating Kurt Gödel's constructible hierarchy.

Property Value
dbo:abstract
  • In the mathematical discipline of set theory, ramified forcing is the original form of forcing introduced by to prove the independence of the continuum hypothesis from Zermelo–Fraenkel set theory. Ramified forcing starts with a model M of set theory in which the axiom of constructibility, V = L, holds, and then builds up a larger model M[G] of Zermelo–Fraenkel set theory by adding a generic subset G of a partially ordered set to M, 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 Vα for ordinals α. Their simplification was originally called "unramified forcing", but is now usually just called "forcing". As a result, ramified forcing is only rarely used. (en)
dbo:wikiPageID
  • 15634017 (xsd:integer)
dbo:wikiPageLength
  • 2097 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1044622905 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dct:subject
gold:hypernym
rdfs:comment
  • In the mathematical discipline of set theory, ramified forcing is the original form of forcing introduced by to prove the independence of the continuum hypothesis from Zermelo–Fraenkel set theory. Ramified forcing starts with a model M of set theory in which the axiom of constructibility, V = L, holds, and then builds up a larger model M[G] of Zermelo–Fraenkel set theory by adding a generic subset G of a partially ordered set to M, imitating Kurt Gödel's constructible hierarchy. (en)
rdfs:label
  • Ramified forcing (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License