THM0057canonicalv1Genealogical DAG Structure (Hinge 7)
The pair DAG := (Code, ->_NF) is a countable, strongly-normalising, finite-width directed acyclic graph: acyclic via well-founded measure, SN bounded by pass budget k_0, finite-width polynomial in primorial M_k, unique root c_empty, one NF sink per teq-class. Sinks(DAG)/teq = AddrTau. Source: Hinge 7 section-05-dag.
Payload
Genealogical DAG Structure (Hinge 7)
The pair DAG := (Code, ->_NF) is a countable, strongly-normalising, finite-width directed acyclic graph: acyclic via well-founded measure, SN bounded by pass budget k_0, finite-width polynomial in primorial M_k, unique root c_empty, one NF sink per teq-class. Sinks(DAG)/teq = AddrTau. Source: Hinge 7 section-05-dag.
Genealogical DAG Structure (Hinge 7)
Summary
The pair DAG := (Code, ->_NF) is a countable, strongly-normalising, finite-width directed acyclic graph: acyclic via well-founded measure, SN bounded by pass budget k_0, finite-width polynomial in primorial M_k, unique root c_empty, one NF sink per teq-class. Sinks(DAG)/teq = AddrTau. Source: Hinge 7 section-05-dag.
Statement
No manuscript statement was extracted in this pilot run.
Proof / Justification
No immediate manuscript proof block was extracted in this pilot run.
Source Context
- Registry source:
book-01.jsonlline 257 - Manuscript source: not matched
Lean / Formalization Notes
- Formalization:
planned - Module:
TauLib.BookI.Addressability.GenealogicalDAG - Name:
None
Dependencies
- Canonical: I.T53, I.T54
Related Results
Generated by later projection phases.
Related Publications
Generated by later projection phases.
Revision Notes
- 2026-04-24: Initial pilot migration.
Identifiers
Aliases & legacy IDs
I.T55genealogical-dag-structure-hinge-7thm:main-dagRelease lines
corpus_v3_workingcorpus_v2Relations
Appears in (1)
Sources
Version & History
Status disclaimer
A Corpus Item page reports the program's current internal record for this item. It does not imply external verification, scientific consensus, or final proof unless explicitly stated. Read it together with its dependencies, formalization status, and the program's overall stance.