OurBigBook About$ Donate
 Sign in Sign up

Ground-model uncountable subset lemma for countable forcing

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Set theory Forcing Countable forcing
2026-10-06  0 By others on same topic  0 Discussions Create my own version
An uncountable set of ground-model elements in a generic extension by countable forcing contains an uncountable ground-model subset. Partition membership witnesses according to the countably many forcing conditions.

 Ancestors (7)

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

 Incoming links (3)

  • Countable forcing preserves Suslin trees
  • Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 24 / 5 / c / ii / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 24 / 5 / c / i / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  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