Table of contents
Signature
Formal definition
A Signature is a triple :
where:
- is the sort set — a finite set of type names; sorts classify the objects a structure operates on; in the relational universe, the sort set is drawn from the type vocabulary
- is the operation symbol set — a finite set of named operation symbols; each operation symbol names one thing a structure of this signature must provide
- is the arity function — assigning each operation a profile , meaning takes inputs of sorts and produces output of sort ; an operation with empty input sequence () is a constant — it declares that a value of sort must be provided with no further input
Four invariants. is a signature iff it satisfies:
-
Finiteness: and — signatures are finite; they admit decidable satisfaction checking; infinite signatures cannot be verified at any history.
-
Profile closure: is well-typed — every sort appearing in any profile is in : for every with , each and is in . A profile mentioning an undeclared sort is not a valid arity.
-
No axioms: a signature carries no equations, implications, or constraints on what the operations must do — it specifies the syntactic interface only. Adding axioms produces a Theory; the signature and its theory are distinct objects. This is the Goguen-Burstall separation: the signature category Sig is the syntactic level; models (implementations) are the semantic level.
-
Operation distinctness: operation symbols in are distinct names. Two operations with identical profiles but distinct names are distinct operations — the name is part of the specification, not an implementation detail.
Signature morphism
A signature morphism is a pair where:
- is a sort map — a function on sort names
- is an operation map — a function on operation symbols
subject to the profile-preservation condition: for every with ,
The morphism translates names: it maps each operation in to an operation in whose profile is the sort-translated profile of the original.
Signature morphisms are not required to be injective. A morphism may merge distinct sorts ( need not be injective) or map distinct operations to the same target operation ( need not be injective). This allows for renaming, collapsing, and forgetting.
The category . Signatures with their morphisms form a category: identity morphism ; composition , . Profile-preservation composes.
has all colimits (set-theoretic construction). In particular, given a span , the pushout is formed by taking the disjoint union of sorts and operations from and and identifying the images of under and . This is the signature union over a common sub-signature.
Inclusion morphism. If and with , , and , then the inclusions form a signature morphism . This is the subsumption morphism used by CapabilitySignature: when all operations are 0-ary constants and the sort set is , signature inclusion coincides with capability-signature subsumption.
Implementations
A -implementation of a signature over a relational universe is an assignment:
- For each sort : a carrier (a relational universe object of sort )
- For each operation with : a relational-universe-morphism
An implementation interprets the signature: it provides concrete objects and morphisms for every declared sort and operation symbol.
Reduct functor. A signature morphism induces a reduct functor going backward:
The reduct re-labels: it takes an -implementation and reads it as an -implementation by following the translation. The reduct forgets all operations and sorts in that are not in the image of .
Reduct is contravariantly functorial: and .
Institution structure
The relational universe admits a signature-theoretic reading as an institution (Goguen & Burstall, JACM 39(1), 1992): an institution consisting of:
- — the category of signatures (as defined above)
- — a covariant functor assigning to each signature the set of -propositions expressible in the fiber Heyting algebra; a signature morphism acts on sentences by forward translation : substituting each sort and operation in a sentence with its -image
- — a contravariant functor assigning to each the category of -implementations; a morphism acts as the reduct functor going backward
- — satisfaction at history : implementation iff when interpreted under
The satisfaction condition (Goguen & Burstall’s coherence axiom): for every signature morphism , every -implementation , and every -sentence :
Truth is invariant under change of notation. Translating a sentence forward to (via ) and checking it against gives the same result as checking the original sentence against the reduct . This coherence axiom is what makes the institution hang together: morphisms rename without changing what is true.
Nuclear derivation
Signature proposition. For each signature recognized within normative system at history , define:
as the proposition “signature is constitutively active in at history .” This is a proposition about the existence of the specification interface itself — distinct from any proposition about an implementation.
Implementation proposition. For each structure and signature at history , define:
as the proposition “structure implements signature at history ” — provides a doubly-settled carrier and morphism for every sort and operation in .
Signature operativity. Signature is operative at iff:
The double-settlement: — the interface is recognized by the normative community; — the interface is stable forward.
Implementation operativity. operatively implements at iff:
This requires (signature operative) and, for each sort , the carrier proposition , and for each operation , the morphism proposition .
Four failure modes for :
| Quadrant | Signature status | ||
|---|---|---|---|
| Operative: recognized and institutionally stable | |||
| Recognized but fragile — accepted as an interface but not institutionally sustained forward | |||
| Structurally required but unrecognized — the system needs this interface but no community has named it | |||
| Proposed only — drafted but inoperative |
Theorem (Implementation Persistence). If and is a morphism in the site , then .
Proof sketch. By the Persistence Theorem for (Institution): restriction maps satisfy . Since , .
Implementation Persistence is the nuclear content of the satisfaction condition: a structure that operatively implements a signature at also operatively implements it at every earlier history .
Theorem (Reduct Monotonicity). If is a signature morphism and , then .
Proof sketch. means every carrier and operation for , is doubly settled. The reduct uses carriers and operations for , — all in the image of , hence all doubly settled. Therefore .
Reduct Monotonicity is the nuclear statement of the satisfaction condition: implementing a richer signature entails implementing every signature into which a morphism exists. This is the general theorem of which CapabilitySignature’s Subsumption Satisfaction Monotonicity is the restricted (0-ary inclusion-morphism) case.
FARS instantiation
In FARS, two specific classes of signatures appear:
0-ary signatures (params: blocks). Every spec’s params: block is a signature with sort set and all operations of arity 0 (constants). The params: entry name: type declares a constant operation named name of output sort type. The capability-signature (see CapabilitySignature) is the FARS name for this restricted form.
Nuclear pair signature. The nuclear pair on fiber has the signature:
with and — two 1-ary operations from sort to sort . An implementation of is exactly a pair of endomorphisms on — the nuclear pair itself is one such implementation, and the axioms (inflation, monotonicity, idempotence) are added to obtain the theory of nuclei from this signature.
Signature vs. adjacent concepts
| Concept | What it specifies | Has axioms? | Morphisms | Key source |
|---|---|---|---|---|
| Signature | Sort names + operation profiles | No | Sort-map + operation-map preserving profiles | Goguen & Burstall (1992) |
| CapabilitySignature | 0-ary signature over | No | Subsumption inclusion | This system; RBAC (Sandhu 1996) |
| Theory | Signature + axiom set | Yes | Theory morphism (sig morphism preserving consequence) | Goguen & Burstall (1992) |
| Institution | Category of signatures + Sen + Mod + | No — axioms live in theories | Institution morphism | Goguen & Burstall (1992) |
| NormativeSystem | Roles + norms + deontic constraints | Yes | Normative morphism | This system |
A signature is the syntactic skeleton; a theory is the signature plus axioms; a specification is a theory intended for implementation (possibly open/parameterized); a normative system is a theory whose axioms are deontic (obligation, permission, prohibition).
Open questions
- Whether the institution satisfies the amalgamation property for its signature pushouts: given a pushout and implementations , agreeing on (their reducts to coincide), whether there exists an implementation whose reducts to and are and . This would allow theories to be combined by specification union — a key tool for modular specification.
- Whether derived signature morphisms — where an operation in maps not to a single operation in but to a term built from -operations — are necessary for expressing renaming-by-definition in this system; and whether derived morphisms preserve the satisfaction condition or require a stronger version (the term-translation variant studied in Mossakowski et al. 2016).
- Whether the sort set of a signature should be closed under the type constructors of the relational universe (products , exponentials , presheaf type ) — whether the FARS type vocabulary needs to be closed under these operations to form a well-behaved signature category, or whether partial closure is sufficient.
- Whether the Grothendieck institution construction (Diaconescu 2002) applies: given that our system has multiple “levels” of signature (0-ary for FARS specs, 1-ary for nuclear pairs, higher for general algebraic structures), whether there is an indexed institution that is flattened into a single global institution via the Grothendieck construction — and whether the resulting global signature category captures the multi-level structure of the system.
- Whether the initial algebra (the term algebra over signature ) has a nuclear representation — whether corresponds to the least doubly-settled implementation: and for any other with , there is a unique implementation morphism that is doubly-settled.