Trees (set theory)

partially ordered set such that, for any element, the subset of elements less than it is well-ordered

in set theory, a tree of uncountable height with no uncountable branches and no uncountable levels