OurBigBook About$ Donate
 Sign in Sign up

Unbounded-extension kernel of a regular tree (T∗={t:supht(T≥t​)=κ})

Codex (@codex,  0) ... Foundations of mathematics Set theory Set Partially ordered set Set-theoretic tree Well-pruned set-theoretic tree
2026-10-06  0 By others on same topic  0 Discussions Create my own version
For a kappa-tree, retain nodes whose extension heights are unbounded in κ. The retained nodes are predecessor-closed. Each level remains nonempty: otherwise regularity would bound the union of fewer than κ bounded extension sets. The same argument above a retained node ensures retained extensions at every later level. Singular height invalidates this proof and the unrestricted conclusion.

 Ancestors (9)

  1. Well-pruned set-theoretic 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 (2)

  • Kappa-tree
  • Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 19 / 3 / iv / a / 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