Revision as of 11:16, 12 May 2010 edit LilHelpa (talk \| contribs) Extended confirmed users, Pending changes reviewers 413,966 edits m →References: General fixes and Typo fixing using AWB ← Previous edit		Revision as of 17:49, 6 November 2013 edit undo GPHemsley (talk \| contribs) Extended confirmed users, Template editors 5,238 edits +{{technical}}; +{{math-stub}} Next edit →
Line 1: {{technical}} In [[descriptive set theory]], a '''tree''' on a set <math>X</math> is a set of finite sequences of elements of <math>X</math> that is closed under initial segments. Line 46 ⟶ 47: ==References== * {{Cite book\| last = Kechris \| first = Alexander S. \| authorlink = Alexander S. Kechris \| title = Classical Descriptive Set Theory \| others = [[Graduate Texts in Mathematics]] 156 \| publisher = Springer \| year = 1995 \| id = ISBN 0-387-94374-9 ISBN 3-540-94374-9}} {{math-stub}} {{DEFAULTSORT:Tree (Descriptive Set Theory)}}

Tree (descriptive set theory): Difference between revisions