Revision as of 21:37, 22 June 2020 edit Trovatore (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 39,123 edits Undid revision 963974885 by Howard McCay (talk) this is a more conventional style in the discipline Tag: Undo ← Previous edit		Revision as of 14:36, 3 January 2021 edit undo Hellacioussatyr (talk \| contribs) Extended confirmed users 10,151 edits No edit summary Tags: Reverted Mobile edit Mobile web edit Advanced mobile edit Next edit →
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 ~~<math>~~{{mvar\|X~~</math>~~}} is a collection of [[finite sequence]]s of elements of ~~<math>~~{{mvar\|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