Res Agentica
Reading

No saved reading position.

Reading

No saved reading position.

Notation and Conventions

6 min read
Aa
Text size
Written accountNotation and Conventions

This page collects the notation used throughout the book. Mathematical symbols follow standard conventions where they exist; departures are noted.

Logic and Derivability

SymbolMeaning
⊢\vdashSyntactic derivability: Γ⊢p\Gamma \vdash p means pp is provable from Γ\Gamma
⊬\nvdashNot derivable: Γ⊬p\Gamma \nvdash p means pp is not provable from Γ\Gamma
⊨\vDashSemantic satisfaction: M⊨ϕM \vDash \phi means model MM satisfies ϕ\phi
⊥\botContradiction / falsity
¬p\neg pNegation of pp
p∧qp \land qConjunction
p∨qp \lor qDisjunction
p→qp \to qImplication

Set and Type Notation

SymbolMeaning
∈\inMembership
⊆\subseteqSubset (inclusive)
∅\emptysetEmpty set
Π(p)\Pi(p)Type of witnesses for proposition pp
π:Π(p)\pi : \Pi(p)Witness π\pi has type "evidence for pp"

Equivalence and Identity

SymbolMeaning
==Equality in the stated mathematical setting; type-identity judgments are identified where used
≅\congIsomorphism: structure-preserving bijection with explicit inverse
≃\simeqEquivalence in the declared setting: categorical equivalence uses inverse functors up to natural isomorphism; HoTT passages use type equivalence
∼S\sim_SScoped equivalence: x∼Syx \sim_S y means xx and yy are equivalent in scope SS

Convention: A10/A16 operational equivalence records declare scope and the properties they support. Mathematical equivalences are interpreted under their stated objects, ambient theory and hypotheses.

Category Theory

SymbolMeaning
f:A→Bf : A \to BMorphism from AA to BB
g∘fg \circ fComposition: apply ff first, then gg
idA\text{id}_AIdentity morphism on AA
F:C→DF : \mathcal{C} \to \mathcal{D}Functor from category C\mathcal{C} to D\mathcal{D}
F⊣GF \dashv GAdjunction: FF is left adjoint to GG
Hom(A,B)\text{Hom}(A, B)Set of morphisms from AA to BB

Schemas and Signatures

SymbolMeaning
Σ\SigmaSignature: types + predicates + constraints
(Σ,I)(\Sigma, I)Signature with constraint set II
M⊨(Σ,I)M \vDash (\Sigma, I)Model MM satisfies signature under constraints
Σ→Σ′\Sigma \to \Sigma'Signature morphism; vocabulary inclusion is a special case
T(U)T(U)Local theory at context UU: (Σ,I,LU)(\Sigma, I, L_U) including logic choice

A3 uses the schema shorthand Σ=(T,P,I)\Sigma=(T,P,I), including integrity constraints. The displayed theory notation (Σ,I)(\Sigma,I) exposes that constraint component separately; it does not add a second set of constraints. In comparisons of theories, the vocabulary and governing constraints must both be identified.

Contexts and Covers

SymbolMeaning
U,V,WU, V, WContexts (views, perspectives, local frames)
{Ui→U}\{U_i \to U\}Cover of UU by family of contexts
s∣Uis\vert_{U_i}Restriction of section ss to context UiU_i
Ui∩UjU_i \cap U_jOverlap of contexts (where gluing conditions apply)

Commitment and Provenance

SymbolMeaning
CCCommitment set (propositions the system has asserted)
C⊬⊥C \nvdash \botCommitment set is consistent
(p,π)(p, \pi)Witnessed assertion: claim pp with witness π\pi
Γ⊢π:Π(p)\Gamma \vdash \pi : \Pi(p)Under context Γ\Gamma, π\pi is evidence for pp

Anchors (A1–A32)

Formal definitions are marked with anchor identifiers. Later chapters depend on these definitions and on the order in which they appear.

Numbering convention:

  • Primary anchors: A1, A2, A3, ...
  • Sub-anchors: A2b, A2c, A12b, etc. (refinements or components of a primary anchor)
  • Status: formal (definition, written statement or construction), preformal (requirement awaiting a model), or engineering (proposed operational discipline)

The dependency graph is acyclic by construction. Appendix F contains the full anchor registry with formal statements and dependencies.

Touchstones (T1–T10)

The ten touchstones are recurring questions and worked examples, including constructed cases. They connect the definitions to operations a reader can examine. Their conclusions depend on the stated representation and hypotheses; they are not empirical proof that every system needs this architecture.

IDNameDomainOne-Line Description
T1ContradictionStringQuery for impossible objects (primes divisible by 4)
T2ReferenceStringSame referent, different surface (morning star / evening star)
T3CompositionalityStringSystematic generalization (SCAN-style "add jump")
T4ExactnessStringDiscrete quantities (counting, arithmetic)
T5Negation/AbsenceStringCategory boundaries, exceptions (flying mammals)
T6Predicate InventionRelationalNew dimension on demand ("puffy dress")
T7Contextual EquivalenceBothSame sometimes, not always (NYC vs New York City)
T8Uncertainty/ValueRelationalNon-factual targets ("best restaurant")
T9Schema EvolutionRelationalVocabulary drift over time (employees → workers)
T10Higher-Arity EventsRelationalN-ary meaning ("Alice introduced Bob to Carol")

Each touchstone maps to required artifacts and resolving anchors. The full registry appears in Appendix E.

General Conventions

Written statements, constructions and open problems retain their stated status. Appendix K.8 identifies the machine-checked declarations separately.

Logic choice: Different contexts may operate under different logics (classical vs. intuitionistic). When logic matters, it is stated explicitly. Local theory T(U)=(Σ,I,LU)T(U) = (\Sigma, I, L_U) includes the logic LUL_U.

Running examples: The fashion catalog domain (dresses, predicates like "puffy," equivalences like "blue" vs. "navy") serves as the primary worked example throughout.

Search the book

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

Search every published chapter, section and reference.

    In this chapter