Signature (logic)

A signature is a list of math signs. It tells us how to use tools. These tools help us build ideas.

One tool is a function. This can be a sign like plus. Another tool is a relation. This shows how things connect.

A signature also has constant signs. These are signs like zero.

Some lists have only relations. These are called relational signatures. Some have only functions. These are called algebraic signatures.

These signs help us make math talk. They are like a kit for building math.

In math, a signature is a special list of symbols. It acts like a kit for building a language. This kit tells us which tools we can use.

One tool is a function symbol. These symbols act like actions. For example, the plus sign (+) is a function. Another tool is a relation symbol. These show how things connect. A sign like "less than" is a relation. A signature also includes constant symbols. These are fixed values, like the number zero (0).

Every symbol in the kit has an arity. Arity is a number that shows how many inputs a symbol needs. A function might need two numbers to work. This makes it a binary function.

We use different names for these kits. In algebra, people call a signature a "type." In model theory, it is often called a "vocabulary."

Some kits are very simple. A relational signature has no function symbols. An algebraic signature has no relation symbols. A signature can be finite or infinite. This just means the list is small or very large. These symbols help us make math sentences. They give us the parts to build complex ideas.

In the world of math, we use symbols to talk about ideas. But before we can build sentences, we need a set of tools. This set of tools is called a signature. You can think of a signature as a kit for building a language. It tells us exactly which symbols we are allowed to use. Without a signature, we would not know how to start a math conversation.

A signature is made of a few specific parts. First, it has function symbols. These are like actions, such as the plus sign (+) or the multiplication sign (×). Next, it has relation symbols. These show how things connect, like the "less than" sign (≤). A signature also includes constant symbols. These are fixed values that do not change, such as the numbers 0 or 1.

Every symbol in the kit has a special number called arity. Arity tells us how many inputs a symbol needs to work. For example, a symbol might need two numbers to make sense. We call this a binary symbol. If a symbol needs only one input, it is called unary. Some symbols, like constants, have an arity of zero. This means they do not need any other numbers to work.

Different math experts use different names for these kits. In a field called universal algebra, people often call a signature a "type" or a "similarity type." In model theory, experts might call it a "vocabulary." Even though the names change, the job stays the same. These names help scientists organize their tools. Some kits are finite, meaning they have a small list of symbols. Others are infinite and have a very large list.

We use these kits to build everything in a formal language. The language is the set of all possible sentences we can make. We use the signature symbols along with logical symbols to do this. If a signature has no function symbols, we call it a relational signature. If it has no relation symbols, it is an algebraic signature. These kits allow us to describe complex things, like a vector space. They give us the rules for how our math language must behave.

In mathematical logic, a signature serves as a formal description of the non-logical symbols within a language. While logical symbols provide the structure of reasoning, the signature provides the specific content used in that reasoning. In the field of universal algebra, a signature is used to list the operations that define an algebraic structure. Model theory utilizes signatures for both of these purposes. Though vital for formal systems, signatures are rarely discussed explicitly in philosophical treatments of logic.

A formal, single-sorted signature is defined as a 4-tuple, denoted by the Greek letter sigma. This tuple consists of four distinct components: a set of function symbols, a set of relation symbols, a set of constant symbols, and an arity function. The sets of function and relation symbols must be disjoint, meaning they do not overlap. They also cannot contain any other basic logical symbols. These components work together to define the boundaries of what a specific mathematical language can express.

Function symbols represent operations, such as addition (+) or multiplication (×). Relation symbols, also called predicates, describe connections between objects, such as the "less than or equal to" symbol (≤) or the membership symbol (∈). Constant symbols represent fixed values, like the numbers 0 or 1. The arity function is a critical part of the signature. It assigns a natural number, known as arity, to every function and relation symbol. If a symbol has an arity of n, it is referred to as an n-ary symbol.

Signatures can be categorized based on their contents. A signature that contains no function symbols is known as a relational signature. Conversely, a signature with no relation symbols is called an algebraic signature. Some mathematicians define constant symbols as nullary function symbols, which are functions with an arity of zero. However, many authors in mathematical logic prefer to treat constant symbols as a separate set. This separation ensures that constant symbols are disjoint from function symbols, which can simplify certain mathematical proofs.

Terminology varies depending on the mathematical discipline. In universal algebra, the term "type" or "similarity type" is often used as a synonym for signature. In model theory, a signature is frequently called a vocabulary. It is also sometimes identified with the first-order language, L, which the signature helps to build. It is important to note that the cardinality of a language is always infinite. Even if a signature is finite, the resulting language will have a cardinality of aleph-null.

The size of a signature is measured by its cardinality. This is calculated by adding the number of function symbols, relation symbols, and constant symbols together. A signature is considered finite if its sets of function and relation symbols are finite. Some signatures can be infinite, which is necessary for describing complex systems. For example, to formalize a vector space over an infinite scalar field F, a signature might include an infinite set of unary operations. Each operation would represent scalar multiplication by a specific element from that field.

Signatures are essential for building formal languages. The language of a signature is the set of all well-formed sentences created from its symbols and the symbols of the logical system. In a structure, an interpretation connects the symbols to actual mathematical objects. An n-ary function symbol is interpreted as a function that maps an n-fold Cartesian product of a domain back into that domain. Similarly, an n-ary relation symbol is interpreted as a relation within that same domain. This process allows abstract symbols to represent real mathematical actions and properties.