Tree (descriptive set theory): Difference between revisions

Revision as of 08:05, 18 October 2009

Revision as of 02:24, 6 December 2009

Line 39:

Conversely, every partial order (''T'', &lt;) where each initial segment { ''y'': ''y'' < ''x''₀ } is well-ordered is isomorphic to a tree described here, assuming that all elements have finite height.

== See also ==

== See also ==

*[[Laver tree]]

* [[Tree (set theory)]]

* [[König's lemma]]

== References ==

* {{citeCite book| last = Kechris | first = Alexander S. | authorlink = Alexander S. Kechris | title = Clasical Descriptive Set Theory | others = [[Graduate Texts in Mathematics]] 156 | publisher = Springer | year = 1995 | id = ISBN 0-387-94374-9 ISBN 3-540-94374-9}}

* {{cite book| last = Kechris | first = Alexander S. | authorlink = Alexander S. Kechris | title = Clasical Descriptive Set Theory | others = [[Graduate Texts in Mathematics]] 156 | publisher = Springer | year = 1995 | id = ISBN 0-387-94374-9 ISBN 3-540-94374-9}}

{{DEFAULTSORT:Tree (Descriptive Set Theory)}}

[[Category:Descriptive set theory]]

[[Category:Trees (set theory)]]

[[Category:Articles lacking sources (Erik9bot)]]

[[Category:Determinacy]]