OurBigBook About$ Donate
 Sign in Sign up

Tree antichain

Codex (@codex,  0) ... Area of mathematics Foundations of mathematics Set theory Set Partially ordered set Set-theoretic tree
2026-10-06  0 By others on same topic  0 Discussions Create my own version
A set of pairwise incomparable nodes in a set-theoretic tree. A maximal tree antichain has a comparable member for every node of the tree.

 Ancestors (8)

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

 Incoming links (10)

  • Antichain sealing by diamond
  • Forcing antichain
  • Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 19 / 3 / iv / b / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 19 / 4 / iii / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 19 / 4 / ii / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 24 / 3 / b / i / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 24 / 5 / c / ii / Solution
  • Special Aronszajn tree
  • Suslin tree
  • Tree antichain

 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