finding
active
finding:elements-of-domains-form-partially-ordered-information-states-where-d-e-means-e-conveys-at-least-as-much-information-as-dElements of domains form partially ordered information states where d ⊑ e means 'e conveys at least as much information as d'.
Core intuition of Domain Theory: qualitative ordering of information states provides foundation for modeling computation without quantification.
Neighborhood — ranked by edge-count
Communities (2)
community
- Cross-scale frameworks linking spatial patterns, diagrams, and simplicity as expressions of care in design.
- Framework treating wholes as primary with parts defined through relationships; emphasizes information preservation through structure-preserving transformations and distributed emergence of organized systems.
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.
- Foundational hypothesis of Domain Theory: partial order structure (D, ⊑) captures information ordering without quantification.
- Claim referencing Wittgenstein and later work that meaning of information depends on context.
- The set of classical probability distributions, ordered by Bayesian projections, forms a dcpo with least element the uniform distribution and max elements pure states; Shannon entropy is a measurement of type Delta^n -> [0,∞).
- Ganter's assertion that concept lattice transformation does not lose information from the original formal context.
- Property of denotative programming from Landin.
- Definition/claim about iceberg lattices.