Tree (descriptive set theory): Difference between revisions

Revision as of 12:40, 25 June 2014

Revision as of 22:03, 19 October 2016

Line 1:

{{about|mathematical trees described by prefixes of finite sequences|trees described by partially ordered sets|Tree (set theory)}}

{{merge|Tree (set theory)|discuss=Talk:Tree_(descriptive_set_theory)#Merge With Tree (set theory)|date=October 2016}}

In [[descriptive set theory]], a '''tree''' on a set <math>X</math> is a collection of [[finite sequence]]s of elements of <math>X</math> such that every [[Prefix (computer science)|prefix]] of a sequence in the collection also belongs to the collection.