The Fn forcing order is
(1)
It is ordered by reverse inclusion:
(2)
so a stronger condition specifies more values. Its maximal, or weakest, element is the empty function .

Ancestors (12)

  1. i
  2. a
  3. 2
  4. Paper 128
  5. iii
  6. 2024
  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