2000 character limit reached
Structural theory of trees. II. Completeness and completions of trees
Published 16 Jan 2023 in math.CO and math.LO | (2301.06352v1)
Abstract: Trees are partial orderings where every element has a linearly ordered set of smaller elements. We define and study several natural notions of completeness of trees, extending Dedekind completeness of linear orders and Dedekind-MacNeille completions of partial orders. We then define constructions of \emph{tree completions} that extend any tree to a minimal one satisfying the respective completeness property.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.