Partial orders naturally represent partial information states in computation.

{
  "doc": "2021-10-18_Prabros._1604.02603.pdf_6f9f31.md",
  "author": null,
  "context": "Foundational hypothesis of Domain Theory: partial order structure (D, ⊑) captures information ordering without quantification.",
  "enrichment": {
    "is_stale": true
  },
  "norm_label": "Partial orders naturally represent partial information states in computation.",
  "source_url": null,
  "graphify_id": "partial_order_partial_info",
  "source_file": "2021-10-18_Prabros._1604.02603.pdf_6f9f31.md",
  "imported_from": "/Users/antonborzov/Documents/Research.nosync/papers/extract_typed_out/2021-10-18_Prabros._1604.02603.pdf_6f9f31/graph.json",
  "extracted_type": "hypothesis",
  "source_location": "§3.1.3",
  "graphify_file_type": "hypothesis"
}