Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Rasiowa–Sikorski_lemma> ?p ?o }
Showing triples 1 to 42 of
42
with 100 triples per page.
- Rasiowa–Sikorski_lemma abstract "In axiomatic set theory, the Rasiowa–Sikorski lemma (named after Helena Rasiowa and Roman Sikorski) is one of the most fundamental facts used in the technique of forcing. In the area of forcing, a subset D of a forcing notion (P, ≤) is called dense in P if for any p ∈ P there is d ∈ D with d ≤ p. A filter F in P is called D-generic ifF ∩ E ≠ ∅ for all E ∈ D.Now we can state the Rasiowa–Sikorski lemma:Let (P, ≤) be a poset and p ∈ P. If D is a countable family of dense subsets of P then there exists a D-generic filter F in P such that p ∈ F.".
- Rasiowa–Sikorski_lemma wikiPageExternalLink forcingdum.
- Rasiowa–Sikorski_lemma wikiPageID "30864999".
- Rasiowa–Sikorski_lemma wikiPageLength "3224".
- Rasiowa–Sikorski_lemma wikiPageOutDegree "23".
- Rasiowa–Sikorski_lemma wikiPageRevisionID "610403906".
- Rasiowa–Sikorski_lemma wikiPageWikiLink Axiomatic_set_theory.
- Rasiowa–Sikorski_lemma wikiPageWikiLink Cambridge_University_Press.
- Rasiowa–Sikorski_lemma wikiPageWikiLink Cardinality.
- Rasiowa–Sikorski_lemma wikiPageWikiLink Category:Forcing_(mathematics).
- Rasiowa–Sikorski_lemma wikiPageWikiLink Category:Lemmas.
- Rasiowa–Sikorski_lemma wikiPageWikiLink Countable.
- Rasiowa–Sikorski_lemma wikiPageWikiLink Countable_chain_condition.
- Rasiowa–Sikorski_lemma wikiPageWikiLink Countable_set.
- Rasiowa–Sikorski_lemma wikiPageWikiLink Dense_order.
- Rasiowa–Sikorski_lemma wikiPageWikiLink Filter_(mathematics).
- Rasiowa–Sikorski_lemma wikiPageWikiLink Forcing_(mathematics).
- Rasiowa–Sikorski_lemma wikiPageWikiLink Generic_filter.
- Rasiowa–Sikorski_lemma wikiPageWikiLink Helena_Rasiowa.
- Rasiowa–Sikorski_lemma wikiPageWikiLink Martins_axiom.
- Rasiowa–Sikorski_lemma wikiPageWikiLink Partial_function.
- Rasiowa–Sikorski_lemma wikiPageWikiLink Partially_ordered_set.
- Rasiowa–Sikorski_lemma wikiPageWikiLink Poset.
- Rasiowa–Sikorski_lemma wikiPageWikiLink Roman_Sikorski.
- Rasiowa–Sikorski_lemma wikiPageWikiLink Set_Theory:_An_Introduction_to_Independence_Proofs.
- Rasiowa–Sikorski_lemma wikiPageWikiLink Set_theory.
- Rasiowa–Sikorski_lemma wikiPageWikiLinkText "Rasiowa–Sikorski lemma".
- Rasiowa–Sikorski_lemma hasPhotoCollection Rasiowa–Sikorski_lemma.
- Rasiowa–Sikorski_lemma wikiPageUsesTemplate Template:Cite_book.
- Rasiowa–Sikorski_lemma subject Category:Forcing_(mathematics).
- Rasiowa–Sikorski_lemma subject Category:Lemmas.
- Rasiowa–Sikorski_lemma comment "In axiomatic set theory, the Rasiowa–Sikorski lemma (named after Helena Rasiowa and Roman Sikorski) is one of the most fundamental facts used in the technique of forcing. In the area of forcing, a subset D of a forcing notion (P, ≤) is called dense in P if for any p ∈ P there is d ∈ D with d ≤ p. A filter F in P is called D-generic ifF ∩ E ≠ ∅ for all E ∈ D.Now we can state the Rasiowa–Sikorski lemma:Let (P, ≤) be a poset and p ∈ P.".
- Rasiowa–Sikorski_lemma label "Rasiowa–Sikorski lemma".
- Rasiowa–Sikorski_lemma sameAs Lemma_von_Rasiowa-Sikorski.
- Rasiowa–Sikorski_lemma sameAs Lema_de_Rasiowa-Sikorski.
- Rasiowa–Sikorski_lemma sameAs Rasiowa-Sikorski_lemma.
- Rasiowa–Sikorski_lemma sameAs ラショーヴァ=シコルスキの補題.
- Rasiowa–Sikorski_lemma sameAs m.06w2my.
- Rasiowa–Sikorski_lemma sameAs Q1816937.
- Rasiowa–Sikorski_lemma sameAs Q1816937.
- Rasiowa–Sikorski_lemma wasDerivedFrom Rasiowa–Sikorski_lemma?oldid=610403906.
- Rasiowa–Sikorski_lemma isPrimaryTopicOf Rasiowa–Sikorski_lemma.