Primitive notion in the context of "Principia Mathematica"

In logic, a predicate is a non-logical symbol that represents a property or a relation, though, formally, does not need to represent anything at all. For instance, in the first-order formula ${\displaystyle P(a)}$, the symbol ${\displaystyle P}$ is a predicate that applies to the individual constant ${\displaystyle a}$ which evaluates to either true or false. Similarly, in the formula ${\displaystyle R(a,b)}$, the symbol ${\displaystyle R}$ is a predicate that applies to the individual constants ${\displaystyle a}$ and ${\displaystyle b}$. Predicates are considered a primitive notion of first-order, and higher-order logic and are therefore not defined in terms of other more basic concepts.

The term derives from the grammatical term "predicate", meaning a word or phrase that represents a property or relation.

In geometry, a point is an abstract idealization of an exact position, without size, in physical space, or its generalization to other kinds of mathematical spaces. As zero-dimensional objects, points are usually taken to be the fundamental indivisible elements comprising the space, of which one-dimensional curves, two-dimensional surfaces, and higher-dimensional objects consist.

In classical Euclidean geometry, a point is a primitive notion, defined as "that which has no part". Points and other primitive notions are not defined in terms of other concepts, but only by certain formal properties, called axioms, that they must satisfy; for example, "there is exactly one straight line that passes through two distinct points". As physical diagrams, geometric figures are made with tools such as a compass, scriber, or pen, whose pointed tip can mark a small dot or prick a small hole representing a point, or can be drawn across a surface to represent a curve.

In formal language theory and computer programming, string concatenation is the operation of joining character strings end-to-end. For example, the concatenation of "snow" and "ball" is "snowball". In certain formalizations of concatenation theory, also called string theory, string concatenation is a primitive notion.

In mathematics, equality is a relationship between two quantities or expressions, stating that they have the same value, or represent the same mathematical object. Equality between A and B is denoted with an equals sign as A = B, and read "A equals B". A written expression of equality is called an equation or identity depending on the context. Two objects that are not equal are said to be distinct.

Equality is often considered a primitive notion, meaning it is not formally defined, but rather informally said to be "a relation each thing bears to itself and nothing else". This characterization is notably circular ("nothing else"), reflecting a general conceptual difficulty in fully characterizing the concept. Basic properties about equality like reflexivity, symmetry, and transitivity have been understood intuitively since at least the ancient Greeks, but were not symbolically stated as general properties of relations until the late 19th century by Giuseppe Peano. Other properties like substitution and function application weren't formally stated until the development of symbolic logic.

In the foundations of mathematics, von Neumann–Bernays–Gödel set theory (NBG) is an axiomatic set theory that is a conservative extension of Zermelo–Fraenkel–choice set theory (ZFC). NBG introduces the notion of class, which is a collection of sets defined by a formula whose quantifiers range only over sets. NBG can define classes that are larger than sets, such as the class of all sets and the class of all ordinals. Morse–Kelley set theory (MK) allows classes to be defined by formulas whose quantifiers range over classes. NBG is finitely axiomatizable, while ZFC and MK are not.

A key theorem of NBG is the class existence theorem, which states that for every formula whose quantifiers range only over sets, there is a class consisting of the sets satisfying the formula. This class is built by mirroring the step-by-step construction of the formula with classes. Since all set-theoretic formulas are constructed from two kinds of atomic formulas (membership and equality) and finitely many logical symbols, only finitely many axioms are needed to build the classes satisfying them. This is why NBG is finitely axiomatizable. Classes are also used for other constructions, for handling the set-theoretic paradoxes, and for stating the axiom of global choice, which is stronger than ZFC's axiom of choice.

In formal systems particularly mathematical logic, a function symbol is a non-logical symbol which represents a function or mapping on the domain of discourse, though, formally, does not need to represent anything at all. Function symbols are a basic component in formal languages to form terms. Specifically, if the symbol ${\displaystyle F}$ is a function symbol, then given any constant symbol ${\displaystyle X}$ representing an object in the language, ${\displaystyle F(X)}$ also represents an object in the language. Similarly, if ${\displaystyle T}$ is some term in the language, ${\displaystyle F(T)}$ is also a term. As such, the interpretation of a function symbol must be defined over the whole domain of discourse. Function symbols are a primitive notion, and are therefore not defined in terms of other, more basic concepts.

In typed logic, F is a functional symbol with domain type T and codomain type U if, given any symbol X representing an object of type T, F(X) is a symbol representing an object of type U.One can similarly define function symbols of more than one variable, analogous to functions of more than one variable; a function symbol in zero variables is simply a constant symbol.