Hubbry Logo
search
logo

Non-logical symbol

logo
Community Hub0 Subscribers
Write something...
Be the first to start a discussion here.
Be the first to start a discussion here.
See all
Non-logical symbol

In mathematical logic, especially model theory, non-logical symbols are elements of a formal language whose interpretation may change depending on the model. In first-order logic, these usually consist of constant symbols, function symbols, and predicates. This is in contrast to logical constants which are required to have the same interpretation under every model, such as logical connectives and quantifiers.

A non-logical symbol only has meaning or semantic content when one is assigned to it by means of an interpretation. Consequently, a sentence containing a non-logical symbol lacks meaning except under an interpretation, so a sentence is said to be true or false under an interpretation. These concepts are defined and discussed in the article on first-order logic, and in particular the section on syntax.

The equality symbol is sometimes treated as a non-logical symbol and sometimes treated as a symbol of logic. If it is treated as a logical symbol, then any interpretation will be required to interpret the equality sign using true equality; if interpreted as a non-logical symbol, it may be interpreted by an arbitrary equivalence relation.

A signature is a set of non-logical constants together with additional information identifying each symbol as either a constant symbol, or a function symbol of a specific arity n (a natural number), or a relation symbol of a specific arity. The additional information controls how the non-logical symbols can be used to form terms and formulas. For instance if f is a binary function symbol and c is a constant symbol, then f(xc) is a term, but c(xf) is not a term. Relation symbols cannot be used in terms, but they can be used to combine one or more (depending on the arity) terms into an atomic formula.

For example a signature could consist of a binary function symbol +, a constant symbol 0, and a binary relation symbol <.

Structures over a signature, also known as models, provide formal semantics to a signature and the first-order language over it.

A structure over a signature consists of a set (known as the domain of discourse) together with interpretations of the non-logical symbols: Every constant symbol is interpreted by an element of and the interpretation of an -ary function symbol is an -ary function on that is, a function from the -fold cartesian product of the domain to the domain itself. Every -ary relation symbol is interpreted by an -ary relation on the domain; that is, by a subset of

An example of a structure over the signature mentioned above is the ordered group of integers. Its domain is the set of integers. The binary function symbol is interpreted by addition, the constant symbol 0 by the additive identity, and the binary relation symbol < by the relation less than.

See all
User Avatar
No comments yet.