To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

Signature (logic)

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

Formally, a (single-sorted) signature can be defined as a triple σ = (Sfunc, Srel, Sconst, ar), where Sfunc and Srel are disjoint sets not containing any other basic logical symbols, called respectively

• function symbols (examples: +, ×, 0, 1),
• relation symbols or predicates (examples: ≤, ∈),
• constant symbols (examples: 0, 1),

and a function ar: Sfunc ${\displaystyle \cup }$ Srel${\displaystyle \mathbb {N} }$ which assigns a natural number called arity to every function or relation symbol. A function or relation symbol is called n-ary if its arity is n. Some authors define a nullary (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 Sfunc and Srel are finite. More generally, the cardinality of a signature σ = (Sfunc, Srel, Sconst, ar) is defined as |σ| = |Sfunc| + |Srel| + |Sconst|.

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

In universal algebra the word type or similarity type is often used as a synonym for "signature". In model theory, a signature σ is often called a vocabulary, or identified with the (first-order) language L to which it provides the non-logical symbols. However, the cardinality of the language L will always be infinite; if σ is finite then |L| will be 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), where − 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)."

Formally this would define the function symbols of the signature as something like f0 (which is binary), f1 (which is unary) and f2 (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 Sconst disjoint from Sfunc, on which the arity function 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 Sfunc = {+} ∪ {fa: aF} and Srel = {=} to formalize expressions and equations about a vector space over an infinite scalar field F, where each fa denotes the unary operation of scalar multiplication by 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

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-ary function symbol f in a structure A with domain A is a function fAAn → A, and the interpretation of an n-ary relation symbol is a relation RA ⊆ An. Here An = A × A × ... × A denotes the n-fold cartesian product of the domain A with itself, and so f is in fact an n-ary function, and R an n-ary relation.

Many-sorted signatures

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

Let S be a set (of sorts) not containing the symbols × or →.

The symbol types over S are certain words over the alphabet ${\displaystyle S\cup \{\times ,\to \}}$: the relational symbol types s1 × ... × sn, and the functional symbol types s1 × ... × sns, for non-negative integers n and s1, s2, ..., sn, s′ ∈ S. (For n = 0, the expression s1 × ... × sn denotes the empty word.)

Signature

A (many-sorted) signature is a triple (S, P, type) consisting of

• a set S of sorts,
• a set P of symbols, and
• a map type which associates to every symbol in P a symbol type over S.

Notes

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

Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.