OurBigBook About$ Donate
 Sign in Sign up

Rasiowa–Sikorski lemma

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Set theory Forcing Generic filter
2026-10-03  1 By others on same topic  0 Discussions Create my own version
If M is a countable transitive model, P∈M, and p∈P, enumerate the dense subsets of P belonging to M and recursively choose a decreasing sequence starting below p that meets each one. Its upward closure is a generic filter over M containing p.

 Ancestors (7)

  1. Generic filter
  2. Forcing
  3. Set theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 121 / 3 / iii / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Rasiowa–Sikorski lemma by Wikipedia Bot  1
 View more
The Rasiowa–Sikorski lemma is a result in the field of mathematical logic, particularly in set theory and model theory. It provides a criterion for determining whether a certain kind of subset exists in a model of set theory. The lemma is named after the mathematicians Helena Rasiowa and Andrzej Sikorski, who contributed to the field of logic in the mid-20th century.
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook