Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2014/iii/paper-19/5/iv/c/solution

In , take ordered by extension. Strong inaccessibility gives . In , each of these ground levels is therefore countable, while the height is . Thus the unchanged ground set-theoretic tree is an -tree in the extension.
Every ground binary function of length still yields a distinct cofinal branch through this set-theoretic tree. There are such branches. The -chain condition preserves cardinals at and above , so . The ground branch family still has at least that cardinality. Consequently
This Kurepa tree from an inaccessible binary tree uses ground-model levels and branches; it does not claim the full binary set-theoretic tree newly computed in the extension has countable levels.

New to topics? Read the docs here!