- Predicate variable
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.
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. .
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"1, "X"2, "X"3,... However, if the predicate variables are not perceived (or defined) as actually belonging to the vocabulary of the predicate calculus, then they are actually predicate metavariables, whereas the rest of the predicate letters are just called "predicate letters". The metavariables are thus understood to be used to actually code for axiom schemata and theorem schemata (derived from the axiom schemata). Whether the "predicate letters" are actually constants or variables is a subtle point: they are not constants in the same sense that are predicate constants, or that 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 of Pred.Calc.: 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 actually represent propositions, then such variables are actually 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
*Rudolf Carnap and William H. Meyer. "Introduction to Symbolic Logic and Its Applications." Dover Publications (June 1, 1958). ISBN 0-486-60453-5
Wikimedia Foundation. 2010.
Look at other dictionaries:
predicate variable — noun logic : a variable for which a predicate may be substituted … Useful english dictionary
Predicate functor logic — In mathematical logic, predicate functor logic (PFL) is one of several ways to express first order logic (formerly known as predicate logic) by purely algebraic means, i.e., without quantified variables. PFL employs a small number of algebraic… … Wikipedia
variable — (logic) A fundamental notion of modern logic. Intuitively, suppose we have a class of objects about which we might be interested (a domain), and we start with a simple sentence ‘Jane is hungry’. We then strike out mention of Jane, leaving a gap… … Philosophy dictionary
Predicate logic — In mathematical logic, predicate logic is the generic term for symbolic formal systems like first order logic, second order logic, many sorted logic or infinitary logic. This formal system is distinguished from other systems in that its formulas… … Wikipedia
Predicate (logic) — Sometimes it is inconvenient or impossible to describe a set by listing all of its elements. Another useful way to define a set is by specifying a property that the elements of the set have in common. The notation P(x) is used to denote a… … Wikipedia
Functional predicate — In formal logic and related branches of mathematics, a functional predicate, or function symbol, is a logical symbol that may be applied to an object term to produce another object term.Functional predicates are also sometimes called mappings ,… … Wikipedia
Syntactic predicate — A syntactic predicate specifies the syntactic validity of applying a production in a formal grammar and is analogous to a semantic predicate that specifies the semantic validity of applying a production. It is a simple and effective means of… … Wikipedia
Monadic predicate calculus — In logic, the monadic predicate calculus is the fragment of predicate calculus in which all predicate letters are monadic (that is, they take only one argument), and there are no function letters. All atomic formulae have the form P(x), where P… … Wikipedia
n-place predicate — A predicate thought of as an open sentence that requires n variables to be either bound or substituted by a referring expression to make a closed sentence. Thus ‘ x is the daughter of y ’ is a two place predicate, that can be turned into a… … Philosophy dictionary
bound variable — A variable x is bound in a formula if it is within the scope of a quantifier (in first order logic, (∀x ) or (∃x )). Intuitively this means that as the formula is evaluated and x in this occurrence is assigned to an object, the quantified… … Philosophy dictionary