finding
active
finding:every-finite-non-empty-poset-has-maximal-elementsEvery finite non-empty poset has maximal elements.
Established property used to characterize down-sets and to relate elements to maximal upper bounds.
Source paper
extracted_from(2002) · Priestley, Hilary A.
Neighborhood — ranked by edge-count
Concepts (1)
concept
- Partially Ordered Set (Poset)supportsFundamental structure: a set with a reflexive, antisymmetric, transitive relation.
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- Affirms the non-essentialist, fully relational ontology of graphical elements.
- Identified as the exact computational operation that breaks truth direction generalization.
- Motivating question throughout: using order theory to capture information flow, approximation, and program behavior.
- A core directive from Book 4, p. 95, quoted to define the essence of living process in large buildings.
- How can we discover a maximally informative or interpretable truth subspace rather than just a sufficient one?question0.709Limitation-driven open question about subspace optimality
- Defining requirement of Whitehead compositional theory
- The ultimate simplicity: living forms share the structure of the Void.
- Expresses the aspiration of the new production method to recover a natural quality of order.