Res Agentica
Reading

No saved reading position.

Reading

No saved reading position.

Anchor Registry

Appendix F

10 min read
Aa
Text size

The anchors constitute the book's mathematical spine. Later chapters depend on these definitions. The public dependency graph is generated from proofs/content/dependency-graph.json and validated for all 32 primary anchors, all six subanchors, missing endpoints, and cycles. This registry states the same direct dependencies in reader-facing form. It is not the research lineage graph or Bulla's operational architecture.

Status key: formal — a mathematical definition, written statement or construction; the label does not certify proof or implementation. preformal — a requirement awaiting a specified model. engineering — a proposed operational discipline. Appendix K.8 identifies the machine-checked fragment; each result states its own hypotheses and remaining obligations.

Summary Table

IDNameChapterStatusDependenciesCore Claim
A1Commitment SetCh. 1formal—Assertions extend a commitment set monotonically while preserving consistency
A2Provenance JudgementCh. 2formalA1Claims carry typed evidence: (p,π)(p, \pi) not bare pp
A2bWitnessed AssertionCh. 2formalA2Assertions carry their own verification instructions
A2cWitness ClassesCh. 2formalA2bWitnesses typed by verification regime: decidable, probabilistic, attested
A3Schema as SignatureCh. 3formal—A schema is a signature Σ=(T,P,I)\Sigma = (T, P, I); adding a predicate is a language change
A3bModel & SatisfactionCh. 3formalA3Model-theoretic semantics; conservativity concerns consequences in the old language
A4Epistemic StatusCh. 4formalA3bDerivability, polarity and absence policy are distinct parts of an epistemic judgement
A5Coherence RequirementCh. 5preformalA1–A4Local extensions must agree on overlaps and preserve invariants
A6Sense BoundaryInterlude IpreformalA5Context-indexed equivalence ∼U\sim_U; boundaries create equivalence classes
A7Group Action & InvariantCh. 6formalA1, A3An invariant preserves its value under the specified group action
A8Isomorphism & WitnessCh. 7formalA7Isomorphism requires inverse maps in the specified category
A9AdjunctionCh. 8formalA8An adjunction gives a natural hom-set correspondence with unit and counit laws
A10Witnessed SamenessCh. 9formalA2b, A2c, A6, A8, A9Scoped equivalence records its maps, property footprint and supporting evidence
A11Vocabulary OperatorInterlude IIformalA3, A3b, A10Vocabulary changes expressible distinctions; stabilization requires the declared preservation conditions
A12Cover & RestrictionCh. 10formalA4, A5, A10Context is a restriction structure; truth is indexed by view
A12bContext Site StructureCh. 10formalA12A chosen context category and topology form a site when their axioms hold
A13Sheaf ConditionCh. 11formalA12, A12bFor a sheaf, exact matching on a cover yields a unique amalgamation
A14FibrationCh. 12formalA12, A13A fibration organizes reindexing; descent requires additional structure
A15Logic SelectionCh. 13formalA4, A12Different views may operate under different logics; merging requires reconciliation
A16Transport DisciplineCh. 14engineeringA10, A13Scoped substitution requires the property mapping and evidence specified by its transport contract
A17Predicate InventionCh. 15formalA3, A5, A11, A13, A16Signature extension introducing qq under grounding, compatibility and invariant obligations; A13 governs its exact-gluing case
A17bConservative ExtensionCh. 16formalA1, A3b, A15, A17Conservativity preserves old-language consequences; query compatibility is a separate obligation
A18Invariant SetCh. 16formalA1, A16, A17bI=Ihard∪IsoftI = I_{\text{hard}} \cup I_{\text{soft}}; hard invariants reject, soft constraints penalize
A19Proposal OperatorCh. 17formalA17, A18Statistical pattern matching produces hypotheses, not certified truths
A19bCertification ContractCh. 17formalA2c, A19Proposed certification distinguishes success, demonstrated failure and an inconclusive check
A20Predicate Search SpaceCh. 18formalA11, A13, A17–A19Inventing predicates is searching a constrained hypothesis space
A21Coherence Cost ModelCh. 19formalA13, A20Declares verification expenditures and budgets; refinement alone gives no cost ordering
A22Context-Graph SubstrateCh. 20formalA2c, A13, A17b, A21Substrate stores locality, witnesses, constraints, and restriction maps
A23Identity MaintenanceCh. 21formalA10, A22Evidence supports scoped identifications and their maintenance
A24Predicate PackageCh. 22formalA17, A17b, A21, A22A predicate ships with signature, tests, invariants, provenance, scope
A25Query SemanticsCh. 23formalA19b, A24Queries are contracts over locality, invariants, and acceptable witnesses
A26Versioning RulesCh. 24formalA17b, A21, A24, A25Versioned compatibility and bounded correction follow actual dependent uses; recorded correction does not complete remedy
A27Refusal ObligationCh. 25formalA1, A18, A25An established inconsistent constraint set can be explained with a checked derivation; an empty query need not be inconsistent
A28Sense GluingCh. 26formalA6, A13, A24Compatible sense assignments glue in the specified function sheaf; not every disambiguation is such a gluing
A29Predicate AcceptanceCh. 27formalA17, A24, A26A proposed admission contract requires scoped tests, invariants and version obligations
A30Scoped EquivalenceCh. 28formalA10, A12, A23Equivalence is context-indexed; transport valid only within scope
A31N-ary Event ObjectCh. 29formalA22, A26Unkeyed role-pair projection can lose event grouping; keyed binary representations can preserve it
A32The Third ModeCh. 30formalA10, A12, A12b, A13, A17, A17b, A21, A30States four design requirements; Appendix I specifies ten operations and their compliance obligations, including correction across reuse

Dependencies and Reading Routes

The graph records the formal dependencies of the constructions as presented. It lets a reader trace a claim back to the definitions and hypotheses it uses. It does not require every receiving operation to invent a predicate, perform exact gluing or implement the whole Third Mode design.

For receiving and reusing evidence, begin with the Part V dossier, then consult Appendix I for the relevant operations. Commitment and witness typing identify what is asserted and how it is checked; A10 and A16 govern scoped substitution; A25 asks what a query requires; A26 follows changes in the grounds consumed. Refusal, unfinished checking and independently supported conclusions remain different outcomes. A fixed vocabulary may suffice for this work. Exact gluing enters when the proposed use depends on the exact local-to-global guarantee and its hypotheses have been established.

For extending the vocabulary, Part IV’s admission problem develops the additional admission problem: proposing a predicate, establishing its grounding, preserving the required old-language consequences and invariants, and accounting for the search and checking work. A24 packages those grounds; A29 states the acceptance obligations. A32 collects the fuller design requirements, and Appendix I supplies the ten-operation manuscript contract. That route adds obligations to reuse; it does not retroactively make every earlier act of reuse a predicate-invention problem.

These are routes through the explanation, not alternative dependency graphs or claims of implementation completeness. A reader assessing a formal result must still inspect its declared prerequisites. A reader using a particular contract must still establish every condition that contract requires.

Normative Correspondence

The 32 anchors constitute the formal apparatus. The following table relates the four formulations of the Codex to relevant formal objects, where supplied.

EquationNormative ClaimAnchorsWhat They Formalize
Truth needs witnessesClaims require evidentiary support adequate to the use made of themA1–A14Commitment sets, provenance judgments, witness classes, schemas, epistemic status, the coherence requirement, sense boundaries, group invariants, isomorphism, adjunctions, witnessed sameness, cover structures, the sheaf condition, fibrations
Value needs workProductive work requires resources; expenditure alone establishes no entitlement to returnsA21Coherence cost categories, checking regimes and declared budgets; withdrawn refinement ordering
Freedom needs receiptsPower that leaves no trace dominates in darkness; receipts make power legibleA17–A20, A22–A29Predicate invention, conservative extension, invariant sets, proposal operators, certification contracts, predicate search, context-graph substrate, identity maintenance, predicate packages, query semantics, versioning, refusal obligation, sense gluing, predicate acceptance
Humanity needs mercyNot formalized—No general mercy rule is derived here

These associations identify relevant formal objects, not a deduction of the four formulations or an ordering among them. A21 models declared coherence costs; it does not establish the trilogy's economic or constitutional conclusions. No formal anchor here derives a general rule of mercy. The absence of one records this companion's scope, not an impossibility theorem.

Witness Claim Index

Volume I states five Witness Claims (WC-08-01 through WC-08-05, all in Ch. 8, Similes of Symmetry). Their formal pointers identify related models, where supplied. The table resolves those references without assigning a formal proof to the institutional argument.

WCPropertyAnchor(s)Related formal object
WC-08-01compositionA21, A24Coherence cost model; predicate package
WC-08-02recourseA23, A10Identity maintenance; witnessed sameness
WC-08-03bindingA1, A2, A10Commitment set; provenance judgement; witnessed sameness
WC-08-04verification-costA21Coherence cost model
WC-08-05temporal-jurisdiction—No formal anchor assigned

WC-08-01 makes the effect of portability depend on practicable alternatives and continuing institutional work. WC-08-04 separates technical verification cost from access, interpretation, correction and governance costs. Neither states a universal sequence of concentration and dispersal or makes rent measurable from verification cost alone.


The chapter anchors supply the statements and citations. proofs/content/dependency-graph.json supplies the declared dependency edges; Appendix K.8 supplies the verification boundary.

← Back to AppendicesBack to The Proofs →

Search the book

Use ↑ ↓ to move through results; Escape to close.

Search every published chapter, section and reference.

    In this chapter