Tree (descriptive set theory): Difference between revisions

Revision as of 21:31, 22 June 2020

Latest revision as of 19:58, 3 January 2021

(2 intermediate revisions by 2 users not shown)

Line 7:

The collection of all finite sequences of elements of a set <math>X</math> is denoted <math>X^{<\omega}</math>.

With this notation, a tree is a nonempty subset <math>T</math> of <math>X^{<\omega}</math>, such that if

<math>\langle x_0,x_1,\ldots,x_nx_{n-1}\rangle</math> is a sequence of length <math>n</math> in <math>T</math>, and if <math>0\le m<n</math>,

then the shortened sequence <math>\langle x_0,x_1,\ldots,x_mx_{m-1}\rangle</math> also belongs to <math>T</math>.  In particular, choosing <math>m=0</math> shows that the empty sequence belongs to every tree.

===Branches and bodies===