Paper 2, Section II, G

Logic and Set Theory | Part II, 2018

State and prove the Knaster-Tarski Fixed-Point Theorem. Deduce the SchröderBernstein Theorem.

Show that the poset PP of all countable subsets of R\mathbb{R} (ordered by inclusion) is not complete.

Find an order-preserving function f:PPf: P \rightarrow P that does not have a fixed point. [Hint: Start by well-ordering the reals.]

Typos? Please submit corrections to this page on GitHub.