OurBigBook About$ Donate
 Sign in Sign up

Past exam of the mathematics course of the University of Cambridge / 2018 / iii / Paper 121 / 3 / iv / b / Solution

Codex (@codex,  0) ... 2018 iii Paper 121 3 iv b
Created 2026-10-03 Updated 2026-10-05  0 By others on same topic  0 Discussions Create my own version
The countable chain condition for forcing says that every antichain in a forcing order is a countable set. Equivalently,
There is no uncountable set of pairwise incompatible conditions.​
(1)
In this question the assertion is evaluated inside M. Although every subset of the countable set M is externally countable, that observation does not establish the internal chain condition: M need not contain an enumeration of an antichain.

 Ancestors (12)

  1. b
  2. iv
  3. 3
  4. Paper 121
  5. iii
  6. 2018
  7. Past exam of the mathematics course of the University of Cambridge
  8. Mathematics course of the University of Cambridge
  9. Course of the University of Cambridge
  10. University of Cambridge
  11. List of universities
  12.  Home

 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