# Formal Logic/Predicate Logic/The Predicate Language

 ← Goals ↑ Predicate Logic Formal Syntax →

# The Predicate Language

This page informally describes our predicate language which we name ${\displaystyle {\mathcal {L_{P}}}\,\!}$ . A more formal description will be given in subsequent pages.

## Language components

Use of ${\displaystyle {\mathcal {L_{P}}}\,\!}$  occurs in the context of a domain of objects. Ascribing a property to 'everything' is only interpreted as ascribing it to everything in the domain.

### Definitions

Variables serve as placeholders in general statements for objects in the domain of discourse. We will use the lower case letters n through z as variables. Frequently, variables correspond to pronouns in statements. For instance, consider the statement 'For any number, if it is even then it is not odd.' Introducing the variable x produces 'For any number x, if x is even then x is not odd.'

An operation letter is a function that takes a fixed number of objects (or variables representing objects) and returns an object in the domain. We write operation letters as lower case letters a through m. An operation letter that takes n objects is called an n-place operation letter. Zero-place operation letters are allowed and merely represent a fixed object. Usually, the context is sufficient to determine the number of places of each operation letter.

For examples on this page, we also allow numerals (${\displaystyle 0,1,2,...}$ ) as zero-place operation letters.

A term is any of the following:

• A variable
• A zero-place operation letter.
• An n-place operation letter (with ${\displaystyle n\geq 1}$ ) followed by a parenthesized list of n terms.

Examples include ${\displaystyle x,y,z}$  (variables); ${\displaystyle a,b,c}$  (zero-place operation letters); ${\displaystyle f(c)}$  (1-place operation letter ${\displaystyle f}$  operating on ${\displaystyle c}$ ); and ${\displaystyle g(x,f(c))}$  (2-place operation letter ${\displaystyle g}$  operating on ${\displaystyle x}$  and ${\displaystyle f(c)}$ ).

If a term contains no variables, then it is called a name. Each name specifies a particular object in the domain, whereas terms containing variables do not.

#### Examples

For the remainder of this page, assume the following translations.

{\displaystyle {\begin{aligned}c\ &:\ \ {\mbox{Cain}}\\f(x)\ &:\ \ {\mbox{the father of}}\ x\\g(x,y)\ &:\ \ {\mbox{the greater of}}\ x\ {\mbox{and}}\ y\end{aligned}}}

With the right set of characters in the domain, ${\displaystyle c\,\!}$  names Cain, and (according to Biblical tradition) ${\displaystyle f(c)\,\!}$  names Adam.

The term ${\displaystyle g(x,y)\,\!}$  is not a name because it contains variables. Then the terms ${\displaystyle g(7,3)\,\!}$  and ${\displaystyle g(3,3)\,\!}$ , however, name 7 and 3 respectively (assuming that 7 and 3 are in the domain).

### Primitive formulae

A predicate letter is a function that takes a fixed number of objects (or variables representing objects) and returns a sentence letter. Predicate letters will consist of capital letters A through Z. The same symbols will be used for predicate letters of any number of places, so, as with operation letters, we sometimes need to specify the number of places but usually can rely on context. Notice that zero-place predicate letters are sentence letters we are familiar with from sentential logic.

A primitive formulae is either one of the following:

• A zero-place predicate letter (that is, a sentence letter).
• An n-place predicate letter (with ${\displaystyle n\geq 1}$ ) followed by a parenthesized list of n terms.

Examples include

${\displaystyle \mathrm {P} \,\!}$
${\displaystyle \mathrm {F} (f(c))\,\!}$
${\displaystyle \mathrm {G} (g(x,y),u,v)\,\!}$

#### Examples

If ${\displaystyle \mathrm {P} \,\!}$  translates 'Snow is white', then it is true. However, it is false if it translates 'Snow is blue'.

Suppose we add the following translations to the translations above:

${\displaystyle \mathrm {F} (x)\ :\ \ x\ {\mbox{is bald}}\,\!}$
${\displaystyle b\ :\ \ {\mbox{Yul Brenner}}\,\!}$
${\displaystyle k\ :\ \ {\mbox{Don King}}\,\!}$

We say that ${\displaystyle \mathrm {F} \,\!}$  is true of all bald things and false of all non-bald things. Thus ${\displaystyle \mathrm {F} (b)\,\!}$  is true while ${\displaystyle \mathrm {F} (k)\,\!}$  is false. Whether ${\displaystyle \mathrm {F} (f(c))\,\!}$  is true or false depends on whether Adam was bald.

${\displaystyle \mathrm {G} (x,y,z)\ :\ \ x\ {\mbox{is between}}\ y\ {\mbox{and}}\ z\,\!}$

to the translations above. Then ${\displaystyle \mathrm {G} (g(x,y),u,v)\,\!}$  is neither true nor false because ${\displaystyle x}$  and ${\displaystyle y}$  are variables that do not name anything, nor do the variables ${\displaystyle u\,\!}$  or ${\displaystyle v\,\!}$ . But if we substitute numbers for the variables, then the ${\displaystyle \mathrm {G} (g(3,3),1,4)\,\!}$  is true while ${\displaystyle \mathrm {G} (g(7,3),1,4)\,\!}$  is false.

### Sentential connectives

The predicate language ${\displaystyle {\mathcal {L_{P}}}\,\!}$  will use sentential connectives just as they were used in the sentential language ${\displaystyle {\mathcal {L_{S}}}\,\!}$ . These were:

${\displaystyle \lnot ,\ \land ,\ \lor ,\ \rightarrow ,\ \mathrm {and} \ \leftrightarrow \,\!}$

Using the translations already set above (together with letting numerals be zero-place operation letters),

${\displaystyle \mathrm {F} (f(d))\lor \mathrm {G} (g(7,3),1,4)\,\!}$

is true while

${\displaystyle \mathrm {F} (f(d))\land \mathrm {G} (g(7,3),1,4)\,\!}$

is false.

### Quantifiers

Quantifiers are special symbols that allow us to construct general sentences which are about all thing or about some (at least one) things.

${\displaystyle {\mbox{Universal quantifier:}}\ \forall \,\!}$

• ${\displaystyle \forall x\,\!}$  translates to English as 'for all x'.
• ${\displaystyle \forall x\ \mathrm {F} (x)\,\!}$  is called a universal generalization.
• ${\displaystyle \forall x\ \mathrm {F} (x)\,\!}$  is true if ${\displaystyle \mathrm {F} (x)\!}$  is true of all objects in the domain. Roughly speaking, it is true if
${\displaystyle \mathrm {F} (a_{1})\land \mathrm {F} (a_{2})\land ...\land \mathrm {F} (a_{n})\,\!}$
where each ${\displaystyle (a_{i})\,\!}$  names an object in the domain and all objects in the domain are named. This is only a rough characterization, however. First, we do not require that all objects in the domain have a name in the predicate language. Second, we allow there to be infinitely many objects in the domain but do not allow infinitely long sentences.
• Some authors use ${\displaystyle (x)\,\!}$  instead of ${\displaystyle \forall x\,\!}$ . This notation is semi-obsolete and is becoming ever less frequent.

${\displaystyle {\mbox{Existential quantifier:}}\ \exists \,\!}$

• ${\displaystyle \exists x\,\!}$  translates to English as 'there exists an x' or, perhaps a bit more clearly, 'there exists at least one x'.
• ${\displaystyle \exists x\ \mathrm {F} (x)\,\!}$  is called an existential generalization.
• ${\displaystyle \exists x\ \mathrm {F} (x)\,\!}$  is true if ${\displaystyle \mathrm {F} (x)\!}$  is true of at least one object in the domain. Roughly speaking, it is true if
${\displaystyle \mathrm {F} (a_{1})\lor \mathrm {F} (a_{2})\lor ...\lor \mathrm {F} (a_{n})\,\!}$
where each ${\displaystyle (a_{i})\,\!}$  names an object in the domain and all objects in the domain are named. This is only a rough characterization, however. First, we do not require that all objects in the domain have a name in the predicate language. Second, we allow there to be infinitely many objects in the domain but do not allow infinitely long sentences.

## Translation

Using the translation scheme

${\displaystyle \mathrm {F} (x)\ :\ \ x\ {\mbox{is a number}}\,\!}$
${\displaystyle \mathrm {G} (x)\ :\ \ x\ {\mbox{is prime}}\,\!}$

we translate as follows.

All numbers are prime.
${\displaystyle \forall x(F(x)\rightarrow G(x))\,\!}$
Some numbers are prime.
${\displaystyle \exists x(F(x)\land G(x))\,\!}$
No numbers are prime.    (two equivalent alternatives are given)
${\displaystyle \forall x(F(x)\rightarrow \lnot G(x))\,\!}$
${\displaystyle \lnot \exists x(F(x)\land G(x))\,\!}$
Some numbers are not prime.
${\displaystyle \exists x(F(x)\land \lnot G(x))\,\!}$

Now using the translation scheme

${\displaystyle \mathrm {P} (x)\ :\ \ x\ {\mbox{is a person}}\,\!}$
${\displaystyle \mathrm {L} (x,y)\ :\ \ x\ {\mbox{loves}}\ y\,\!}$
${\displaystyle g\ :\ \ {\mbox{George}}\,\!}$
${\displaystyle m\ :\ \ {\mbox{Martha}}\,\!}$

we can translate as follows.

George loves Martha.
${\displaystyle \mathrm {L} (g,m)\,\!}$
Martha loves George.
${\displaystyle \mathrm {L} (m,g)\,\!}$
George and Martha love each other.
${\displaystyle \mathrm {L} (g,m)\land \mathrm {L} (m,g)\,\!}$

We can further translate as follows.

Everybody loves everybody.    (the second alternative assumes only persons in the domain)
${\displaystyle \forall x(\mathrm {P} (x)\rightarrow \forall y(\mathrm {P} (y)\rightarrow \mathrm {L} (x,y)))\,\!}$
${\displaystyle \forall x\forall y\mathrm {L} (x,y)\,\!}$
Somebody loves somebody.    (the second alternative assumes only persons in the domain)
${\displaystyle \exists x(\mathrm {P} (x)\land \exists y(\mathrm {P} (y)\land \mathrm {L} (x,y)))\,\!}$
${\displaystyle \exists x\exists y\mathrm {L} (x,y)\,\!}$
Everybody loves somebody (or other).    (the second alternative assumes only persons in the domain)
${\displaystyle \forall x(\mathrm {P} (x)\rightarrow \exists y(\mathrm {P} (y)\land \mathrm {L} (x,y)))\,\!}$
${\displaystyle \forall x\exists y\mathrm {L} (x,y)\,\!}$
Somebody is loved by everybody.    (the second alternative assumes only persons in the domain)
${\displaystyle \exists y\forall x(\mathrm {P} (y)\land (\mathrm {P} (x)\rightarrow \mathrm {L} (x,y)))\,\!}$
${\displaystyle \exists y\forall x\mathrm {L} (x,y)\,\!}$
Everybody is loved by somebody (or other).    (the second alternative assumes only persons in the domain)
${\displaystyle \forall x\exists y(\mathrm {P} (x)\rightarrow \mathrm {P} (y)\land \mathrm {L} (y,x))\,\!}$
${\displaystyle \forall x\exists y\mathrm {L} (y,x)\,\!}$
Somebody loves everybody.    (the second alternative assumes only persons in the domain)
${\displaystyle \exists y\forall x(\mathrm {P} (y)\land (\mathrm {P} (x)\rightarrow \mathrm {L} (y,x)))\,\!}$
${\displaystyle \exists y\forall x\mathrm {L} (y,x)\,\!}$