Signature (logic)

Description of non-logical symbols

In logic, especially mathematical logic, a signature lists and describes the non-logical symbols of a formal language. In universal algebra, a signature lists the operations that characterize an algebraic structure. In model theory, signatures are used for both purposes. They are rarely made explicit in more philosophical treatments of logic.

## Definition

[edit]

Formally, a (single-sorted) signature can be defined as a 4-tuple  σ = ( S func , S rel , S const , ar ) , {\displaystyle \sigma =\left(S_{\operatorname {func} },S_{\operatorname {rel} },S_{\operatorname {const} },\operatorname {ar} \right),} where  S func {\displaystyle S_{\operatorname {func} }} and  S rel {\displaystyle S_{\operatorname {rel} }} are disjoint sets not containing any other basic logical symbols, called respectively

* function symbols (examples:  + , × {\displaystyle +,\times } ),
* relation symbols or predicates (examples:  ≤ , ∈ {\displaystyle \,\leq ,\,\in } ),
* constant symbols (examples:  0 , 1 {\displaystyle 0,1} ),

and a function  ar : S func ∪ S rel -> N {\displaystyle \operatorname {ar} :S_{\operatorname {func} }\cup S_{\operatorname {rel} }\to \mathbb {N} } which assigns a natural number called arity to every function or relation symbol. A function or relation symbol is called  n {\displaystyle n} -ary if its arity is  n . {\displaystyle n.} Some authors define a nullary ( 0 {\displaystyle 0} -ary) function symbol as constant symbol, otherwise constant symbols are defined separately.

A signature with no function symbols is called a relational signature, and a signature with no relation symbols is called an algebraic signature.[1] A finite signature is a signature such that  S func {\displaystyle S_{\operatorname {func} }} and  S rel {\displaystyle S_{\operatorname {rel} }} are finite. More generally, the cardinality of a signature  σ = ( S func , S rel , S const , ar ) {\displaystyle \sigma =\left(S_{\operatorname {func} },S_{\operatorname {rel} },S_{\operatorname {const} },\operatorname {ar} \right)} is defined as  | σ | = | S func | + | S rel | + | S const | . {\displaystyle |\sigma |=\left|S_{\operatorname {func} }\right|+\left|S_{\operatorname {rel} }\right|+\left|S_{\operatorname {const} }\right|.}

The language of a signature is the set of all well formed sentences built from the symbols in that signature together with the symbols in the logical system.

## Other conventions

[edit]

In universal algebra the word type or similarity type is often used as a synonym for "signature". In model theory, a signature  σ {\displaystyle \sigma } is often called a vocabulary, or identified with the (first-order) language L {\displaystyle L} to which it provides the non-logical symbols. However, the cardinality of the language  L {\displaystyle L} will always be infinite; if  σ {\displaystyle \sigma } is finite then  | L | {\displaystyle |L|} will be  ℵ 0 {\displaystyle \aleph _{0}} .

As the formal definition is inconvenient for everyday use, the definition of a specific signature is often abbreviated in an informal way, as in:

"The standard signature for abelian groups is  σ = ( + , − , 0 ) , {\displaystyle \sigma =(+,-,0),} where  − {\displaystyle -} is a unary operator."

Sometimes an algebraic signature is regarded as just a list of arities, as in:

"The similarity type for abelian groups is  σ = ( 2 , 1 , 0 ) . {\displaystyle \sigma =(2,1,0).} "

Formally this would define the function symbols of the signature as something like  f 0 {\displaystyle f_{0}} (which is binary),  f 1 {\displaystyle f_{1}} (which is unary) and  f 2 {\displaystyle f_{2}} (which is nullary), but in reality the usual names are used even in connection with this convention.

In mathematical logic, very often symbols are not allowed to be nullary,[citation needed] so that constant symbols must be treated separately rather than as nullary function symbols. They form a set  S const {\displaystyle S_{\operatorname {const} }} disjoint from  S func , {\displaystyle S_{\operatorname {func} },} on which the arity function  ar {\displaystyle \operatorname {ar} } is not defined. However, this only serves to complicate matters, especially in proofs by induction over the structure of a formula, where an additional case must be considered. Any nullary relation symbol, which is also not allowed under such a definition, can be emulated by a unary relation symbol together with a sentence expressing that its value is the same for all elements. This translation fails only for empty structures (which are often excluded by convention). If nullary symbols are allowed, then every formula of propositional logic is also a formula of first-order logic.

An example for an infinite signature uses  S func = { + } ∪ { f a : a ∈ F } {\displaystyle S_{\operatorname {func} }=\\{+\\}\cup \left\\{f_{a}:a\in F\right\\}} and  S rel = { = } {\displaystyle S_{\operatorname {rel} }=\\{=\\}} to formalize expressions and equations about a vector space over an infinite scalar field  F , {\displaystyle F,} where each  f a {\displaystyle f_{a}} denotes the unary operation of scalar multiplication by  a . {\displaystyle a.} This way, the signature and the logic can be kept single-sorted, with vectors being the only sort.[2]

## Use of signatures in logic and algebra

[edit]

In the context of first-order logic, the symbols in a signature are also known as the non-logical symbols, because together with the logical symbols they form the underlying alphabet over which two formal languages are inductively defined: The set of terms over the signature and the set of (well-formed) formulas over the signature.

In a structure, an interpretation ties the function and relation symbols to mathematical objects that justify their names: The interpretation of an  n {\displaystyle n} -ary function symbol  f {\displaystyle f} in a structure  A {\displaystyle \mathbf {A} } with domain A {\displaystyle A} is a function  f A : A n -> A , {\displaystyle f^{\mathbf {A} }:A^{n}\to A,} and the interpretation of an  n {\displaystyle n} -ary relation symbol is a relation R A ⊆ A n . {\displaystyle R^{\mathbf {A} }\subseteq A^{n}.} Here  A n = A × A × ⋯ × A {\displaystyle A^{n}=A\times A\times \cdots \times A} denotes the  n {\displaystyle n} -fold cartesian product of the domain  A {\displaystyle A} with itself, and so  f {\displaystyle f} is in fact an  n {\displaystyle n} -ary function, and  R {\displaystyle R} an  n {\displaystyle n} -ary relation.

## Many-sorted signatures

[edit]

For many-sorted logic and for many-sorted structures, signatures must encode information about the sorts. The most straightforward way of doing this is via symbol types that play the role of generalized arities.[3]

### Symbol types

[edit]

Let  S {\displaystyle S} be a set (of sorts) not containing the symbols  × {\displaystyle \times } or  -> . {\displaystyle \to .}

The symbol types over  S {\displaystyle S} are certain words over the alphabet  S ∪ { × , -> } {\displaystyle S\cup \\{\times ,\to \\}} : the relational symbol types  s 1 × ⋯ × s n , {\displaystyle s_{1}\times \cdots \times s_{n},} and the functional symbol types  s 1 × ⋯ × s n -> s ′ , {\displaystyle s_{1}\times \cdots \times s_{n}\to s^{\prime },} for non-negative integers  n {\displaystyle n} and  s 1 , s 2 , … , s n , s ′ ∈ S . {\displaystyle s_{1},s_{2},\ldots ,s_{n},s^{\prime }\in S.} (For  n = 0 , {\displaystyle n=0,} the expression  s 1 × ⋯ × s n {\displaystyle s_{1}\times \cdots \times s_{n}} denotes the empty word.)

### Signature

[edit]

A (many-sorted) signature is a triple  ( S , P , type ) {\displaystyle (S,P,\operatorname {type} )} consisting of

* a set  S {\displaystyle S} of sorts,
* a set  P {\displaystyle P} of symbols, and
* a map  type {\displaystyle \operatorname {type} } which associates to every symbol in  P {\displaystyle P} a symbol type over  S . {\displaystyle S.}

## See also

[edit]

* Term algebra – Freely generated algebraic structure over a given signature

## Notes

[edit]

1. ^ Mokadem, Riad; Litwin, Witold; Rigaux, Philippe; Schwarz, Thomas (September 2007). "Fast nGram-Based String Search Over Data Encoded Using Algebraic Signatures" (PDF). 33rd International Conference on Very Large Data Bases (VLDB). Retrieved 27 February 2019.
2. ^ George Grätzer (1967). "IV. Universal Algebra". In James C. Abbot (ed.). Trends in Lattice Theory. Princeton/NJ: Van Nostrand. pp. 173–210. Here: p.173.
3. ^ Many-Sorted Logic, the first chapter in Lecture notes on Decision Procedures, written by Calogero G. Zarba.

## References

[edit]

* Burris, Stanley N.; Sankappanavar, H.P. (1981). A Course in Universal Algebra. Springer. ISBN 3-540-90578-2. Free online edition.
* Hodges, Wilfrid (1997). A Shorter Model Theory. Cambridge University Press. ISBN 0-521-58713-1.

## External links

[edit]

* Stanford Encyclopedia of Philosophy: "Model theory"—by Wilfred Hodges.
* PlanetMath: Entry "Signature" describes the concept for the case when no sorts are introduced.
* Baillie, Jean, "An Introduction to the Algebraic Specification of Abstract Data Types."

* v
* t
* e

Mathematical logic

General|

* Axiom
* list
* Cardinality
* First-order logic
* Formal proof
* Formal semantics
* Foundations of mathematics
* Information theory
* Lemma
* Logical consequence
* Model
* Theorem
* Theory
* Type theory

Theorems (list)
and paradoxes|

* Gödel's completeness and incompleteness theorems
* Tarski's undefinability
* Banach–Tarski paradox
* Cantor's theorem, paradox and diagonal argument
* Compactness
* Halting problem
* Lindström's
* Löwenheim–Skolem
* Russell's paradox

Logics|

| Traditional|

* Classical logic
* Logical truth
* Tautology
* Proposition
* Inference
* Logical equivalence
* Consistency
* Equiconsistency
* Argument
* Soundness
* Validity
* Syllogism
* Square of opposition
* Venn diagram

|

Propositional|

* Boolean algebra
* Boolean functions
* Logical connectives
* Propositional calculus
* Propositional formula
* Truth tables
* Many-valued logic
* 3
* finite
* ∞

Predicate|

* First-order
* list
* Second-order
* Monadic
* Higher-order
* Fixed-point
* Free
* Quantifiers
* Predicate
* Monadic predicate calculus

Set theory|

* Set
* hereditary
* Class
* (Ur-)Element
* Ordinal number
* Extensionality
* Forcing
* Relation
* equivalence
* partition
* Set operations:
* intersection
* union
* complement
* Cartesian product
* power set
* identities

Types of sets|

* Countable
* Uncountable
* Empty
* Inhabited
* Singleton
* Finite
* Infinite
* Transitive
* Ultrafilter
* Recursive
* Fuzzy
* Universal
* Universe
* constructible
* Grothendieck
* Von Neumann

Maps and cardinality|

* Function/Map
* domain
* codomain
* image
* In/Sur/Bi-jection
* Schröder–Bernstein theorem
* Isomorphism
* Gödel numbering
* Enumeration
* Large cardinal
* inaccessible
* Aleph number
* Operation
* binary

Set theories|

* Zermelo–Fraenkel
* axiom of choice
* continuum hypothesis
* General
* Kripke–Platek
* Morse–Kelley
* Naive
* New Foundations
* Tarski–Grothendieck
* Von Neumann–Bernays–Gödel
* Ackermann
* Constructive

Formal systems (list),
language and syntax|

* Alphabet
* Arity
* Automata
* Axiom schema
* Expression
* ground
* Extension
* by definition
* conservative
* Relation
* Formation rule
* Grammar
* Formula
* atomic
* closed
* ground
* open
* Free/bound variable
* Language
* Metalanguage
* Logical connective
* ¬
* ∨
* ∧
* →
* ↔
* =
* Predicate
* functional
* variable
* propositional variable
* Proof
* Quantifier
* ∃
* !
* ∀
* rank
* Sentence
* atomic
* spectrum
* Signature
* String
* Substitution
* Symbol
* function
* logical/constant
* non-logical
* variable
* Term
* Theory
* list

Example axiomatic
systems (list)|

* of arithmetic:
* Peano
* second-order
* elementary function
* primitive recursive
* Robinson
* Skolem
* of the real numbers
* Tarski's axiomatization
* of Boolean algebras
* canonical
* minimal axioms
* of geometry:
* Euclidean:
* Elements
* Hilbert's
* Tarski's
* non-Euclidean

* Principia Mathematica

Proof theory|

* Formal proof
* Natural deduction
* Logical consequence
* Rule of inference
* Sequent calculus
* Theorem
* Systems
* axiomatic
* deductive
* Hilbert
* list
* Complete theory
* Independence (from ZFC)
* Proof of impossibility
* Ordinal analysis
* Reverse mathematics
* Self-verifying theories

Model theory|

* Interpretation
* function
* of models
* Model
* equivalence
* finite
* saturated
* spectrum
* submodel
* Non-standard model
* of arithmetic
* Diagram
* elementary
* Categorical theory
* Model complete theory
* Satisfiability
* Semantics of logic
* Strength
* Theories of truth
* semantic
* Tarski's
* Kripke's
* T-schema
* Transfer principle
* Truth predicate
* Truth value
* Type
* Ultraproduct
* Validity

Computability theory|

* Church encoding
* Church–Turing thesis
* Computably enumerable
* Computable function
* Computable set
* Decision problem
* decidable
* undecidable
* P
* NP
* P versus NP problem
* Kolmogorov complexity
* Lambda calculus
* Primitive recursive function
* Recursion
* Recursive set
* Turing machine
* Type theory

Related|

* Abstract logic
* Algebraic logic
* Automated theorem proving
* Category theory
* Concrete/Abstract category
* Category of sets
* History of logic
* History of mathematical logic
* timeline
* Logicism
* Mathematical object
* Philosophy of mathematics
* Supertask

Mathematics portal
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template