Partial orders naturally represent partial information states in computation.

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.

• Elements of domains form partially ordered information states where d ⊑ e means 'e conveys at least as much information as d'.finding0.798
  Core intuition of Domain Theory: qualitative ordering of information states provides foundation for modeling computation without quantification.
• Order provides terminology, notation, and models across diverse areas of computer science including comparisons of size, information content, and definedness.claim0.793
• Partial Order of Stepsconcept0.783
  Mathematical representation of precedence relations among steps: which centers must be in position before another can be formed, defining good sequences as linearizations that minimize backtracking.
• How can order relations in posets provide semantic models for data and computation?question0.777
  Motivating question throughout: using order theory to capture information flow, approximation, and program behavior.
• Partially Ordered Set (Poset)concept0.773
  Fundamental structure: a set with a reflexive, antisymmetric, transitive relation.
• The kind of order that occurs in living structure has a complexity not usually describable by drawings or by architectural images.claim0.762
  Emphasizes the non-pictorial, process-dependent nature of living order.
• Order (general mathematical structure of space)concept0.758
  A most general system of mathematical structures arising from the nature of space, which has degrees of life.
• The order relation ≤ on a poset P is determined entirely by the down-sets in P.claim0.756