View source for Formal Logic/Predicate Logic/Free and Bound Variables

<noinclude>
{{Formal Logic:TOCPageNav|up=Predicate Logic|prev=Formal Syntax|next=Informal Conventions}}
</noinclude>

= Free and Bound Variables =

== Informal notions ==

The two English sentences,

: If Socrates is a person, then Socrates is mortal,
: if Aristotle is a person, then Aristotle is mortal,

are both true.  However, outside any context supplying a reference for 'it',

: (1) &nbsp;&nbsp; If it is a person, then it is mortal,

is neither true nor false.  'It' is not a name, but rather an empty placeholder.  'It' can refer to an object by picking up its reference from the surrounding context.  But without such context, there is no reference and no truth or falsity.  The same applies to the variable <nowiki>'</nowiki>''x''<nowiki>'</nowiki> in

: (2) &nbsp;&nbsp; If ''x'' is a person, then ''x'' is mortal.

This situation changes with the two sentences:

: (3) &nbsp;&nbsp; For any object, if it is a person, then it is mortal,
: (4) &nbsp;&nbsp; For any object ''x'', if ''x'' is a person, then ''x'' is mortal.

Neither the occurrences of 'it' nor the occurrences of <nowiki>'</nowiki>''x''<nowiki>'</nowiki> in these sentences refer to specific objects as with 'Socrates' or 'Aristotle'.  But (3) and (4) are nonetheless true.  (3) is true if and only if:

: (5) &nbsp;&nbsp; Replacing both occurrences of 'it' in (3) with a reference to any object whatsoever (the same object both times) yields a true result.

But (5) is true and so is (3).  Similarly, (4) is true if and only if:

: (6) &nbsp;&nbsp; Replacing both occurrences of <nowiki>'</nowiki>''x''<nowiki>'</nowiki> in (4) with a reference to any object whatsoever (the same object both times) yields a true result.

But (3) is true and so is (4).  We can call the occurrences of 'it' in (1) free and the occurrences of 'it' in (3) bound.  Indeed, the occurrences of 'it' in (3) are bound by the phrase 'for any'.  Similarly, the occurrences <nowiki>'</nowiki>''x''<nowiki>'</nowiki> in (2) are free while those in (4) are bound.  Indeed, the occurrences of <nowiki>'</nowiki>''x''<nowiki>'</nowiki> in (4) are bound by the phrase 'for any'.

== Formal definitions ==

''An occurrence of a variable'' <math>\alpha\,\!</math> ''is bound'' in <math>\varphi\,\!</math> if that occurrence of <math>\alpha\,\!</math> stands within a subformula of <math>\varphi\,\!</math> having one of the two forms:

: <math>\forall \alpha\, \psi\ ,\,\!</math>
: <math>\exists \alpha\, \psi\ .\,\!</math>

Consider the formula

: <math>(7) \quad (\exists x_0\, \mathrm{F^1_0}(x_0) \rightarrow \forall y_0\, \mathrm{F^1_0}(y_0))\ .\,\!</math>

Both instances of <math>x_0\,\!</math> are bound in (7) because they stand within the subformula

: <math>\exists x_0\, \mathrm{F^1_0}(x_0)\ .\,\!</math>

Similarly, both instances of <math>y_0\,\!</math> are bound in (7) because they stand within the subformula

: <math>\forall y_0\, \mathrm{F^1_0}(y_0)\ .\,\!</math>


''An occurrence of a variable'' <math>\alpha\,\!</math> ''is free'' in <math>\varphi\,\!</math> if and only if <math>\alpha\,\!</math> is not bound in <math>\varphi\,\!</math>.  The occurrences of both <math>x_0\,\!</math> and <math>y_0\,\!</math> in

: <math>(8) \quad (\mathrm{F^1_0}(x_0) \rightarrow \mathrm{G^1_0}(y_0))\,\!</math>

are free in (8) because neither is bound in (8).


We say that ''an occurrence of a variable'' <math>\alpha\,\!</math> ''is bound in by a particular occurrence'' of <math>\forall\,\!</math> if that occurrence is also the first (and perhaps only) symbol in the shortest subformula of <math>\varphi\,\!</math> having the form

: <math>\forall \alpha\, \psi\ .\,\!</math>

Consider the formula

: <math>(9) \quad \forall x_0\, (\mathrm{F^1_0}(x_0) \rightarrow \forall x_0\, \mathrm{G^1_0}(x_0))\ .\,\!</math>

The third and fourth occurrences of <math>x_0\,\!</math> in (9) are bound by the second occurrence of <math>\forall\,\!</math> in (9).  However, they are not bound by the first occurrence of <math>\forall\,\!</math> in (9).  The occurrence of

: <math>(10) \quad \forall x_0\, \mathrm{G^1_0}(x_0)\,\!</math>

in (9)&mdash;as well as the occurrence of (9) itself in (9)&mdash;are subformulae of (9) beginning with a quantifier.  That is, both are subformula of (9) having the form

: <math>\forall \alpha\, \psi\ .\,\!</math>

Both contain the second third and fourth occurrences of <math>x_0\,\!</math> in (9).  However, the occurrence of (10) in (9) is the ''shortest'' subformula of (9) that meets these conditions.  That is, the occurrence of (10) in (9) is the shortest subformula of (9) that both (i) has this form and (ii) contains the third and fourth occurrences of <math>x_0\,\!</math> in (9).  Thus it is the second, not the first, occurrence of <math>\forall\,\!</math> in (9) that binds the third and forth occurrences of <math>x_0\,\!</math> in (9).  The first occurrence of <math>\forall\,\!</math> in (9) ''does'', however, bind the first two occurrences of <math>x_0\,\!</math> in (9).


We also say that ''an occurrence of a variable'' <math>\alpha\,\!</math> ''is bound in by a particular occurrence'' of <math>\exists\,\!</math> if that occurrence is also the first (and perhaps only) symbol in the shortest subformula of <math>\varphi\,\!</math> having the form

: <math>\exists \alpha\, \psi\ .\,\!</math>


Finally, we say that ''a variable'' <math>\alpha\,\!</math> (not a particular occurrence of it) ''is bound (or free)'' in a formula if the formula contains a bound (or free) occurrence of <math>\alpha\,\!</math>.  Thus <math>x_0\,\!</math> is both bound and free in

: <math>(\forall x_0\, \mathrm{F^1_0}(x_0) \rightarrow \mathrm{F^1_0}(x_0))\,\!</math>

since this formula contains both bound and free occurrences of <math>x_0\,\!</math>.  In particular, the first two occurrences of <math>x_0\,\!</math> are bound and the last is free.

== Sentences and formulae ==

A ''sentence'' is a formula with no free variables.  Sentential logic had no variables at all, so all formulae of <math>\mathcal{L_S}\,\!</math> are also sentences of <math>\mathcal{L_S}\,\!</math>.  In predicate logic and its language <math>\mathcal{L_P}\,\!</math>, however, we have formulae that are not sentences.  All of (7), (8), (9), and (10) above are formulae.  Of these, only (7), (9), and (10) are sentences.  (8) is not a sentence because it contains free variables.

== Examples ==

All occurrences of <math>x_0\,\!</math> in

: <math>(11) \quad \forall x_0 (\mathrm{F^1_0}(x_0) \rightarrow  \mathrm{G^2_0}(x_0, y_0))\,\!</math>

are bound in the formula.  The lone occurrence of <math>y_0\,\!</math> is free in the formula. Hence, (11) is a formula but not a sentence.

Only the first two occurrences of <math>x_0\,\!</math> in

: <math>(12) \quad (\forall x_0 \mathrm{F^1_0}(x_0) \rightarrow  \mathrm{G^2_0}(x_0, y_0))\,\!</math>

are bound in the formula.  The last occurrence of <math>x_0\,\!</math> and the lone occurrence of <math>y_0\,\!</math> in the formula are free in the formula.  Hence, (12) is a formula but not a sentence.

All four occurrences of <math>x_0\,\!</math> in

: <math>(13) \quad (\forall x_0 \mathrm{F^1_0}(x_0) \rightarrow  \exists x_0 \mathrm{G^2_0}(x_0, y_0))\,\!</math>

are bound.  The first two are bound by the universal quantifier, the last two are bound by the existential quantifier.  The lone occurrence of <math>y_0\,\!</math> in the formula is free.  Hence, (13) is a formula but not a sentence.

All three occurrences of <math>x_0\,\!</math> in

: <math>(14) \quad \forall x_0 (\mathrm{F^1_0}(x_0) \rightarrow  \exists y_0 \mathrm{G^2_0}(x_0, y_0))\,\!</math>

are bound by the universal quantifier.  Both occurrences of <math>y_0\,\!</math> in the formula are bound by the existential quantifier.  Hence, (14) has no free variables and so is a sentence and as well as a formula.