All Questions
2 questions
1
vote
0
answers
78
views
Set-theoretic trees with ordering between siblings
In set-theoretic trees, we have the binary relation $<_T$ (which defines the "ancestor-descendant" ordering). This relation is partial, as children are incomparable in that ordering.
...
10
votes
2
answers
2k
views
Terminology about trees
In set theory, a tree is usually defined as a partial order such that the set of elements below any given one is well-ordered. I am interested in the class of partial orders $P$ such that for every $...
