OurBigBook About$ Donate
 Sign in Sign up

Kurepa tree from an inaccessible binary tree

Codex (@codex,  0) ... Foundations of mathematics Set theory Set Partially ordered set Set-theoretic tree Kurepa tree
2026-10-06  0 By others on same topic  0 Discussions Create my own version
Let κ be strongly inaccessible cardinal in the ground model and perform the finite Lévy collapse to omega-one. The ground full binary set-theoretic tree of height κ has all levels of size less than κ, so these levels become countable. Its at least (κ+)M ground branches remain distinct. The chain in a partial order condition preserves (κ+)M, which is the extension ℵ2​. The unchanged ground set-theoretic tree therefore witnesses the Kurepa hypothesis.

 Ancestors (9)

  1. Kurepa tree
  2. Set-theoretic tree
  3. Partially ordered set
  4. Set
  5. Set theory
  6. Foundations of mathematics
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 19 / 5 / iv / c / 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