Revision as of 14:36, 3 January 2021 edit Hellacioussatyr (talk \| contribs) Extended confirmed users 10,151 edits No edit summary Tags: Reverted Mobile edit Mobile web edit Advanced mobile edit ← Previous edit		Latest revision as of 19:58, 3 January 2021 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,802 edits Undid revision 998041846 by Hellacioussatyr (talk) please do not convert properly formatted mathematics markup into junk pseudo-math templates Tag: Undo
Line 1: {{about\|mathematical trees described by prefixes of finite sequences\|trees described by partially ordered sets\|Tree (set theory)}} In [[descriptive set theory]], a '''tree''' on a set ~~{{mvar\|~~<math>X}}</math> is a collection of [[finite sequence]]s of elements of ~~{{mvar\|~~<math>X}}</math> such that every [[Prefix (computer science)\|prefix]] of a sequence in the collection also belongs to the collection. ==Definitions==

Tree (descriptive set theory): Difference between revisions