|logic||category theory||type theory|
|true||terminal object/(-2)-truncated object||h-level 0-type/unit type|
|false||initial object||empty type|
|proposition||(-1)-truncated object||h-proposition, mere proposition|
|cut rule||composition of classifying morphisms / pullback of display maps||substitution|
|cut elimination for implication||counit for hom-tensor adjunction||beta reduction|
|introduction rule for implication||unit for hom-tensor adjunction||eta conversion|
|disjunction||coproduct ((-1)-truncation of)||sum type (bracket type of)|
|implication||internal hom||function type|
|negation||internal hom into initial object||function type into empty type|
|universal quantification||dependent product||dependent product type|
|existential quantification||dependent sum ((-1)-truncation of)||dependent sum type (bracket type of)|
|equivalence||path space object||identity type|
|equivalence class||quotient||quotient type|
|induction||colimit||inductive type, W-type, M-type|
|higher induction||higher colimit||higher inductive type|
|completely presented set||discrete object/0-truncated object||h-level 2-type/preset/h-set|
|set||internal 0-groupoid||Bishop set/setoid|
|universe||object classifier||type of types|
|modality||closure operator, (idemponent) monad||modal type theory, monad (in computer science)|
|linear logic||(symmetric, closed) monoidal category||linear type theory/quantum computation|
|proof net||string diagram||quantum circuit|
|(absence of) contraction rule||(absence of) diagonal||no-cloning theorem|
|synthetic mathematics||domain specific embedded programming language|
Formally, a signature consists of
A set whose elements are called sorts or types of ,
A set whose elements are called relation symbols, equipped with a function to the free monoid on which prescribes an arity for each relation symbol,
A set whose elements are called function symbols, equipped with a function
which prescribes an arity or type for each function symbol. A function symbol is usually written as to indicate its arity.
The majority of (but far from all) mathematical concepts are described by means of a single-sorted signature, where consists of a single element . Examples where multisorted signatures are used is the theory of categories (with an object sort and a morphism sort) and (multi)directed graphs (with a vertex sort and an edge sort). But in the single-sorted or one-sorted case, the free monoid on the one-sort set is isomorphic to , and the arity of a relation is a number . Hence we speak of an -ary relation (unary, binary, etc.). Similarly, the arity of a function symbol or operation is the number which indexes (hence we speak of unary operations, binary operations, etc.) In either the single-sorted or multisorted case, a 0-ary operation (where the domain empty) is usually called a constant.
A relational signature is where is empty, and an equational or algebraic signature is where is empty. (In the latter case, the only relation symbol is the equality symbol, but this is typically considered a logical symbol.) Occasionally one allows a relational signature to have constants.
A (set-theoretic) model or interpretation of a signature consists of functions which assign
To each sort a set ,
To each relation symbol of arity a subset ,
To each function symbol of type a function . In the case of constants of type , the empty product on the left is taken to be a terminal or 1-element set , whose element needs no name but is often given a generic name like ‘’.
An important point to bear in mind is that essentially the same theories (where ‘same’ means that the categories of models are equivalent or even isomorphic) may have very different signatures. For example,
The theory of groups is usually described as a single-sorted theory whose signature has one binary operation (called ‘multiplication’) , one constant (called ‘identity’), and one unary operation (called ‘inversion’) . But it can also be described using a signature with just one (binary) operation ; there one adds in extra axioms which posit the existence of an identity and of inverse elements. Or, it can be described using a signature with a single (binary) operation (for ‘division’). All these are examples of equational signatures.
A Boolean ring is usually described as a commutative ring with identity in which multiplication is idempotent, hence the theory of Boolean rings is usually presented using the signature normally reserved for rings (with identity). A Boolean algebra may be described using a variety of signatures, for example non-equationally, involving a binary relation and function symbols , , .
The theory ZFC is usually described using a single-sorted relational signature with one binary relation . However, other approaches are possible: one can also describe ZFC with a relational symbol together with a unary function symbol (to be interpreted as taking a ‘set’ , i.e., an element of a ZFC structure, to a singleton ‘set’ ).
The multiplicity of ways in which one can describe essentially the same class of objects is a phenomenon which in higher category theory is often referred to as bias. Often one desires to use an ‘unbiased’ approach which includes different signatures under one roof and on the same footing. In the case of algebraic (equational) theories, this can be done using the device of clones or Lawvere theories, which does not single out certain non-logical operations as ‘privileged’.
There are several reasons though why one might prefer to retain some bias, for example:
Tradition, familiarity, thus ease of reference. For example, a group is a set equipped with a binary , an unary , and a constant , rather than a set equipped with a single division operation, or a finite product-preserving functor for that matter.
Mathematical intuition. That is, different signatures may invoke different intuitions or attitudes toward a subject; for example, “Boolean rings” may invoke a more algebraic or algebro-geometric attitude (as in Stone duality) whereas “Boolean algebras” may invoke a more logical attitude (propositional logic).
Differences in logical strength. That is, first-order logic should be thought of as coming in layers, ranging from equational logic up to pretopos logic, and different signatures may need differing levels of logical strength for them to be interpreted as intended. Equational logic may be preferred on occasion because it is a very weak logic, whereas relational signatures often require at least the strength of regular categories for them to be interpreted correctly.
Each signature generates a language whose elements are predicates formed by using as alphabet. In traditional logical syntax, this runs as follows: (to be filled in).
This can be recast in categorical terms as follows: the operational part of a signature is a span
which generates a multisorted Lawvere theory, .
where is treated as a discrete category. Define an interpretation of to be an ordered pair
where is the underlying-set functor, is the obvious inclusion functor, is a functor whose values on morphisms have left adjoints such that the Beck-Chevalley conditions are satisfied, and is a natural transformation. A morphism of interpretations is a natural transformation commuting with the left adjoints, such that .
The language of is the initial interpretation.
(To be expanded upon and cleaned up…)