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 , the symbol is a predicate that applies to the individual constant which evaluates to either true or false. Similarly, in the formula , the symbol is a predicate that applies to the individual constants and . 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 the semantics of logic, predicates are interpreted as relations. For instance, in a standard semantics for first-order logic, the formula would be true on an interpretation if the entities denoted by and stand in the relation denoted by . Since predicates are non-logical symbols, they can denote different relations depending on the interpretation given to them. While first-order logic only includes predicates that apply to individual objects, other logics may allow predicates that apply to collections of objects defined by other predicates.

Strictly speaking, a predicate does not need to be given any interpretation, so long as its syntactic properties are well-defined. For example, equality may be understood solely through its reflexive and substitution properties (cf. Equality (mathematics) § Axioms). Other properties can be derived from these, and they are sufficient for proving theorems in mathematics. Similarly, set membership can be understood solely through the axioms of Zermelo–Fraenkel set theory.

Predicates in different systems

edit

A predicate is a statement or mathematical assertion that contains variables, sometimes referred to as predicate variables, and may be true or false depending on those variables’ value or values.

See also

edit

References

edit
  1. ^ Lavrov, Igor Andreevich; Maksimova, Larisa (2003). Problems in Set Theory, Mathematical Logic, and the Theory of Algorithms. New York: Springer. p. 52. ISBN 0306477122.
edit

📚 Artikel Terkait di Wikipedia

Predication (computer architecture)

In computer architecture, predication is a feature that provides an alternative to conditional transfer of control, as implemented by conditional branch

Null

copula), a linguistic phenomenon whereby the subject is joined to the predicate without overt marking of this relationship. Null (mathematics), a zero

Prolog

logic. Unlike many other programming languages, Prolog is intended primarily as a declarative programming language: the program is a set of facts and rules

Conditional (computer programming)

In computer programming, a conditional statement directs program control flow based on the value of a condition; a Boolean expression. A conditional expression

Computer program

A computer program is a sequence or set of instructions in a programming language for a computer to execute. It is one component of software, which also

Predicate dispatch

In computer programming, predicate dispatch is a generalisation of multiple dispatch ("multimethods") that allows the method to call to be selected at

Predicate transformer semantics

programs". They define the semantics of an imperative programming paradigm by assigning to each statement in this language a corresponding predicate transformer:

Data type

In computer science and computer programming, a data type (or simply type) is a collection or grouping of data values, usually specified by a set of possible