Predicate variable

In first-order logic, a predicate variable is a predicate letter which can stand for a relation (between terms) but which has not been specifically assigned any particular relation (or meaning). In first-order logic (FOL) they can be more properly called metalinguistic variables. In higher-order logic, predicate variables correspond to propositional variables which can stand for well-formed formulas of the same logic, and such variables can be quantified by means of (at least) second-order quantifiers.

Usage

In the metavariable sense, a predicate variable can be used to define an axiom schema. Predicate variables should be distinguished from predicate constants, which could be represented either with a different (exclusive) set of predicate letters, or by their own symbols which really do have their own specific meaning in their domain of discourse: e.g. ${\displaystyle =,\ \in ,\ \leq ,\ <,\ \subset ,...}$.

If letters are used for predicate constants as well as for predicate variables, then there has to be a way of distinguishing between them. For example, letters W, X, Y, Z could be designated to represent predicate variables, whereas letters A, B, C,..., U, V could represent predicate "constants". If these letters are not enough, then numerical subscripts can be appended, e.g. X₁, X₂, X₃,... However, if the predicate variables are not perceived (or defined) as belonging to the vocabulary of the predicate calculus, then they are predicate metavariables, whereas the rest of the predicate letters are just called "predicate letters". The metavariables are thus understood to be used to code for axiom schemata and theorem schemata (derived from the axiom schemata). Whether the "predicate letters" are constants or variables is a subtle point: they are not constants in the same sense that ${\displaystyle =,\ \in ,\ \leq ,\ <,\ \subset ,}$ are predicate constants, or that ${\displaystyle 1,\ 2,\ 3,\ {\sqrt {2}},\ \pi ,\ e\ }$ are numerical constants.

Another option is to use Greek lower-case letters to represent such metavariable predicates. Then, such letters could be used to represent entire well-formed formulae (wff) of the predicate calculus: any free variable terms of the wff could be incorporated as terms of the Greek-letter predicate. This is the first step towards creating a higher-order logic.

If "predicate variables" are only allowed to be bound to predicate letters of zero arity (which have no arguments), where such letters represent propositions, then such variables are propositional variables, and any predicate logic which allows second-order quantifiers to be used to bind such propositional variables is a second-order predicate calculus, or second-order logic.

If predicate variables are also allowed to be bound to predicate letters which are unary or have higher arity, and when such letters represent propositional functions, such that the domain of the arguments is mapped to a range of different propositions, and when such variables can be bound by quantifiers to such sets of propositions, then the result is a higher-order predicate calculus, or higher-order logic.

References

• Rudolf Carnap and William H. Meyer. Introduction to Symbolic Logic and Its Applications. Dover Publications (June 1, 1958). ISBN 0-486-60453-5