Mathematical logic and foundations Definition
Signature
Builds on Predicate logicFunction
Definition
A signature consists of:
- a set of function symbols;
- a set of relation symbols, disjoint from ;
- an arity function that gives the number of arguments of each symbol.
A function symbol of arity is a constant symbol. The symbols of are the non-logical symbols of a first-order language; the variables, connectives, quantifiers and equality are not part of .
Remarks
The signature of rings is with arities ; it has no relation symbols.
The signature of ordered sets has one relation symbol of arity and no function symbols.
The list "a binary operation that is associative" is not a signature: associativity is an axiom, and a signature contains only symbols and their arities.
Some books list the constant symbols as a third set instead of treating them as functions of arity .
In Mathlib a signature is FirstOrder.Language.
Reading path
To understand this page from the ground up, read these 11 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Function concept
- Proposition concept
- Conjunction definition
- Disjunction definition
- Implication definition
- Negation definition
- Predicate definition
- Biconditional definition
- Propositional logic concept
- Predicate logic concept
- Signature definition
Further reading
About this page
| Tag | PWHJZYBNEY |
|---|---|
| URI | m2://PWHJZYBNEY |
| Kind | definition |
| Writing | W0 stub |
| MSC | 03C07, 03B10 |
| Defines | Signature |
| Uses | Predicate logic, Function |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.