| Information | |
|---|---|
| has gloss | eng: In mathematics, a Suslin tree is a tree of height ω1 such that every branch and every antichain is at most countable. (An antichain is a set of elements such that any two are incomparable.) |
| lexicalization | eng: Suslin tree |
| instance of | e/Tree (set theory) |
Lexvo © 2008-2026 Gerard de Melo. Contact Legal Information / Imprint