← Models

↑ Predicate Logic

Truth →

Satisfaction

The rules for assigning truth to sentences of ${\mathcal {L_{P}}}\,\!$ should say, in effect, that

\forall \alpha \,\varphi \,\!

is true if and only if $\varphi \,\!$ is true of every object in the domain. There are two problems. First, $\varphi \,\!$ will normally have free variables. In particular, it will normally have free $\alpha \,\!$ . But formulae with free variables are not sentences and do not have a truth value. Second, we do not yet have a precise way of saying that $\varphi \,\!$ is true of every object in the domain. The solution to these problems comes in two parts.

We will need an assignment of objects from the domain to the variables.

We will need to say that a model satisfies (or does not satisfy) a formula with a variable assignment.

We can then define truth in a model in terms of satisfaction.

Variable assignment

Given model ${\mathfrak {M}}\,\!$ , a variable assignment $\mathrm {s} \,\!$ is a function assigning each variable of ${\mathcal {L_{P}}}\,\!$ a member of $|{\mathfrak {M}}|\,\!$ . The function $\mathrm {s} \,\!$ is defined for all variables of ${\mathcal {L_{P}}}\,\!$ , so each one is assigned a member of the domain.

Okay, we have assignments of domain members to variables. We also have an assignment of domain members to constant symbols—this achieved by the model's interpretation function. Now we need to use this information to generate assignments of domain members to arbitrary terms including, in addition to constant symbols and variables, complex terms formed by using n-place operation letters where n is greater than 0. This is accomplished by an extended variable assignment ${\overline {\mathrm {s} }}\,\!$ defined below. Remember that $I_{\mathfrak {M}}\,\!$ is the interpretation function of model ${\mathfrak {M}}\,\!$ . It assigns semantic values to the operation letters and predicate letters of ${\mathcal {L_{P}}}\,\!$ .

An extended variable assignment ${\overline {\mathrm {s} }}\,\!$ is a function making assignments as follows.

If

\alpha \,\!

is a variable, then:

{\overline {\mathrm {s} }}(\alpha )\ =\ \mathrm {s} (\alpha )\,\!

If

\alpha \,\!

is a constant symbol (i.e., a 0-place operation letter), then:

{\overline {\mathrm {s} }}(\alpha )\ =\ I_{\mathfrak {M}}(\alpha )\,\!

If

\zeta \,\!

is an n-place operation letter (n greater than 0) and

\alpha _{1},\ \alpha _{2},\ \ldots ,\ \alpha _{n}\,\!

are terms, then:

{\overline {\mathrm {s} }}(\,\zeta (\alpha _{1},\,\alpha _{2},\,\ldots ,\,\alpha _{n})\,)\ =\ I_{\mathfrak {M}}(\zeta )\,(\ {\overline {\mathrm {s} }}(\,\alpha _{1}),\,{\overline {\mathrm {s} }}(\alpha _{2}),\,\ldots ,\,{\overline {\mathrm {s} }}(\alpha _{n})\ )\,\!

Some examples may help. Suppose we have model $I_{\mathfrak {M}}\,\!$ where:

|{\mathfrak {M}}|\ =\ \{1,\,2,\,3\}\ .\,\!

I_{\mathfrak {M}}(a_{0}^{0})\ =\ 0\ .\,\!

I_{\mathfrak {M}}(b_{0}^{0})\ =\ 1\ .\,\!

I_{\mathfrak {M}}(f_{0}^{2})\ =\ {\mathfrak {f}}_{0}^{2}\ {\mbox{such that:}}\quad {\mathfrak {f}}_{0}^{2}(0,\,0)=2,\ {\mathfrak {f}}_{0}^{2}(0,\,1)\ =\ 1,\ {\mathfrak {f}}_{0}^{2}(0,\,2)=0,\,\!

{\mathfrak {f}}_{0}^{2}(1,\,0)=1,\ {\mathfrak {f}}_{0}^{2}(1,\,1)\ =\ 0,\ {\mathfrak {f}}_{0}^{2}(1,\,2)=2,\ {\mathfrak {f}}_{0}^{2}(2,\,0)=0,\,\!

{\mathfrak {f}}_{0}^{2}(2,\,1)=2,\ {\mbox{and}}\ {\mathfrak {f}}_{0}^{2}(2,\,2)=1\ .\,\!

On the previous page, it was noted that we want the following result:

f(a,b)\ {\mbox{resolves to}}\ 1\ \mathrm {in} \ {\mathfrak {M}}\ .\,\!

We now have achieved this because we have for any $\mathrm {s} \,\!$ defined on $I_{\mathfrak {M}}\,\!$ :

{\overline {\mathrm {s} }}(f(a,b))\ =\ I_{\mathfrak {M}}(f)\,(\ {\overline {\mathrm {s} }}(a),\,{\overline {\mathrm {s} }}(b)\ )\ =\ {\mathfrak {f}}_{0}^{2}(\ {\overline {\mathrm {s} }}(a),\,{\overline {\mathrm {s} }}(b)\ )\,\!

=\ {\mathfrak {f}}_{0}^{2}(\ I_{\mathfrak {M}}(a),\,I_{\mathfrak {M}}(b)\ )\ =\ {\mathfrak {f}}_{0}^{2}(0,\,1)\ =\ 1\ .\,\!

Suppose we also have a variable assignment $\mathrm {s} \,\!$ where:

\mathrm {s} (x_{0})\ =\ 0\ .\,\!

\mathrm {s} (y_{0})\ =\ 1\ .\,\!

Then we get:

{\overline {\mathrm {s} }}(f(x,y))\ =\ I_{\mathfrak {M}}(f)\,(\ {\overline {\mathrm {s} }}(x),\,{\overline {\mathrm {s} }}(y)\ )\ =\ {\mathfrak {f}}_{0}^{2}(\ {\overline {\mathrm {s} }}(x),\,{\overline {\mathrm {s} }}(y)\ )\,\!

=\ {\mathfrak {f}}_{0}^{2}(f)\,(\ \mathrm {s} (x),\,\mathrm {s} (y)\ )\ =\ {\mathfrak {f}}_{0}^{2}(0,\,1)\ =\ 1\ .\,\!

Satisfaction

A model, together with a variable assignment, can satisfy (or fail to satisfy) a formula. Then we will use the notion of satisfaction with a variable assignment to define truth of a sentence in a model. We can use the following convenient notation to say that the interpretaion ${\mathfrak {M}}\,\!$ satisfies (or does not satisfy) $\varphi \,\!$ with $\mathrm {s} \,\!$ .

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \varphi \,\!

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \not \vDash \,\varphi \,\!

We now define satisfaction of a formula by a model with a variable assignment. In the following, 'iff' is used to mean 'if and only if'.

{\mbox{i.}}\quad {\mbox{For}}\ \sigma \ {\mbox{a sentence letter:}}\,\!

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \sigma \quad {\mbox{iff}}\quad I_{\mathfrak {M}}(\sigma )\ =\ \mathrm {True} \ .\,\!

{\mbox{ii.}}\quad {\mbox{For}}\ \pi \ {\mbox{an}}\ n{\mbox{--place predicate letter and for}}\ \alpha _{0},\,\alpha _{1},\,\ldots ,\,\alpha _{n}\ {\mbox{any terms:}}\,\!

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \pi (\alpha _{0},\,\alpha _{1},\,\ldots ,\,\alpha _{n})\quad {\mbox{iff}}\ <\!{\overline {\mathrm {s} }}(\alpha _{0}),\,{\overline {\mathrm {s} }}(\alpha _{1}),\,\ldots ,\,{\overline {\mathrm {s} }}(\alpha _{n})\!>\ \in \ I_{\mathfrak {M}}(\pi )\ .\,\!

{\mbox{iii.}}\quad {\mbox{For}}\ \varphi \ {\mbox{a formula:}}\,\!

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \lnot \varphi \quad {\mbox{iff}}\ <\!{\mathfrak {M}},\ \mathrm {s} \!>\ \not \vDash \varphi \ .\,\!

{\mbox{iv.}}\quad {\mbox{For}}\ \varphi \ {\mbox{and}}\ \psi \ {\mbox{formulae:}}\,\!

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash (\varphi \land \psi )\quad {\mbox{iff}}\ <\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \varphi \ \ {\mbox{and}}\ <\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \psi \ .\,\!

{\mbox{v.}}\quad {\mbox{For}}\ \varphi \ {\mbox{and}}\ \psi \ {\mbox{formulae:}}\,\!

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash (\varphi \lor \psi )\quad {\mbox{iff}}\ <\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \varphi \ \ {\mbox{or}}\ <\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \psi \ {\mbox{(or both)}}\ .\,\!

{\mbox{vi.}}\quad {\mbox{For}}\ \varphi \ {\mbox{and}}\ \psi \ {\mbox{formulae:}}\,\!

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash (\varphi \rightarrow \psi )\quad {\mbox{iff}}\ <\!{\mathfrak {M}},\ \mathrm {s} \!>\ \not \vDash \varphi \ \ {\mbox{or}}\ <\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \psi \ {\mbox{(or both)}}\ .\,\!

{\mbox{vii.}}\quad {\mbox{For}}\ \varphi \ {\mbox{and}}\ \psi \ {\mbox{formulae:}}\,\!

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash (\varphi \leftrightarrow \psi )\quad {\mbox{iff}}\ <\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash (\varphi \land \psi )\ \ {\mbox{or}}\ <\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash (\lnot \varphi \land \lnot \psi )\ {\mbox{(or both)}}\ .\,\!

{\mbox{viii.}}\quad {\mbox{For}}\ \varphi \ {\mbox{a formula and}}\ \alpha \ {\mbox{a variable:}}\,\!

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \forall \alpha \,\varphi \quad {\mbox{iff}}\ \ {\mbox{for every}}\ \mathrm {d} \ \in |{\mathfrak {M}}|,\ <\!{\mathfrak {M}},\ \mathrm {s[\alpha \!:\,d]} \!>\ \vDash \varphi \ .\,\!

{\mbox{where}}\ \mathrm {s[\alpha \!:\,d]} \ {\mbox{differs from}}\ \mathrm {s} \ {\mbox{only in assigning}}\ \mathrm {d} \ {\mbox{to}}\ \alpha \ .\,\!

.

{\mbox{ix.}}\quad {\mbox{For}}\ \varphi \ {\mbox{a formula and}}\ \alpha \ {\mbox{a variable:}}\,\!

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \exists \alpha \,\varphi \quad {\mbox{iff}}\ \ {\mbox{for at least one}}\ \mathrm {d} \in |{\mathfrak {M}}|,\ <\!{\mathfrak {M}},\ \mathrm {s[\alpha \!:\,d]} \!>\ \vDash \varphi \ .\,\!

{\mbox{where}}\ \mathrm {s[\alpha \!:\,d]} \ {\mbox{differs from}}\ \mathrm {s} \ {\mbox{only in assigning}}\ \mathrm {d} \ {\mbox{to}}\ \alpha \ .\,\!

.

Examples

The following continue the examples used when describing extended variable assignments above. They are based on the examples of the previous page.

A model and variable assignment for examples

Suppose we have model $I_{\mathfrak {M}}\,\!$ where

|{\mathfrak {M}}|\ =\ \{0,\,1,\,2\}\ .\,\!

I_{\mathfrak {M}}(a_{0}^{0})\ =\ 0\ .\,\!

I_{\mathfrak {M}}(b_{0}^{0})\ =\ 1\ .\,\!

I_{\mathfrak {M}}(c_{0}^{0})\ =\ 2\ .\,\!

I_{\mathfrak {M}}(f_{0}^{2})\ =\ {\mathfrak {f}}_{0}^{2}\ {\mbox{such that:}}\quad {\mathfrak {f}}_{0}^{2}(0,\,0)=2,\ {\mathfrak {f}}_{0}^{2}(0,\,1)\ =\ 1,\ {\mathfrak {f}}_{0}^{2}(0,\,2)=0,\,\!

{\mathfrak {f}}_{0}^{2}(1,\,0)=1,\ {\mathfrak {f}}_{0}^{2}(1,\,1)\ =\ 0,\ {\mathfrak {f}}_{0}^{2}(1,\,2)=2,\ {\mathfrak {f}}_{0}^{2}(2,\,0)=0,\,\!

{\mathfrak {f}}_{0}^{2}(2,\,1)=2,\ {\mbox{and}}\ {\mathfrak {f}}_{0}^{2}(2,\,2)=1\ .\,\!

I_{\mathfrak {M}}(\mathrm {F_{0}^{2}} )\ =\ \{<\!0,\ 1\!>,\ <\!1,\ 2\!>,\ <\!2,\ 1\!>\}\ .\,\!

Suppose further we have a variable assignment $\mathrm {s} \,\!$ where:

\mathrm {s} (x_{0})\ =\ 0\ .\,\!

\mathrm {s} (y_{0})\ =\ 1\ .\,\!

\mathrm {s} (z_{0})\ =\ 2\ .\,\!

We already saw that both of the following resove to 1:

f(a,b)\,\!

f(x,y)\,\!

Examples without quantifiers

Given model ${\mathfrak {M}}\,\!$ , the previous page noted the following further goals:

(1)\quad \mathrm {F} (a,b),\ \mathrm {F} (b,c),\ {\mbox{and}}\ \mathrm {F} (c,b)\ {\mbox{are True in}}\ {\mathfrak {M}}\ .\,\!

(2)\quad \mathrm {F} (a,a)\ {\mbox{is False in}}\ {\mathfrak {M}}\ .\,\!

(3)\quad \mathrm {F} (a,f(a,b))\ {\mbox{is True in}}\ {\mathfrak {M}}\ .\,\!

(4)\quad \mathrm {F} (f(a,b),a)\ {\mbox{is False in}}\ {\mathfrak {M}}\ .\,\!

(5)\quad \mathrm {F} (c,b)\rightarrow \mathrm {F} (a,b)\ {\mbox{is True in}}\ {\mathfrak {M}}\ .\,\!

(6)\quad \mathrm {F} (c,b)\rightarrow \mathrm {F} (b,a)\ {\mbox{is False in}}\ {\mathfrak {M}}\ .\,\!

We are not yet ready to evaluate for truth or falsity, but we can take a step in that direction by seeing that these sentences are satisfied by ${\mathfrak {M}}\,\!$ with $\mathrm {s} .\,\!$ Indeed, the details of $\mathrm {s} \,\!$ will not figure in determining which of these are satisfied. Thus ${\mathfrak {M}}\,\!$ satisfies (or fails to satisfy) them with any variable assignment. As we will see on the next page, that is the criterion for truth (or falsity) in ${\mathfrak {M}}\,\!$ .

Corresponding to (1),

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \mathrm {F} (a,b),\ \mathrm {F} (b,c),\ {\mbox{and}}\ \mathrm {F} (c,b)\ .\,\!

In particular:

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \mathrm {F} (a,b)\ \ {\mbox{because}}\ <\!{\overline {\mathrm {s} }}(a),\,{\overline {\mathrm {s} }}(b)\!>\ =\ <\!0,\,1\!>\ \in \ I_{\mathfrak {M}}(\mathrm {F} )\ .\,\!

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \mathrm {F} (b,c)\ \ {\mbox{because}}\ <\!{\overline {\mathrm {s} }}(b),\,{\overline {\mathrm {s} }}(c)\!>\ =\ <\!1,\,2\!>\ \in \ I_{\mathfrak {M}}(\mathrm {F} )\ .\,\!

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \mathrm {F} (c,b)\ \ {\mbox{because}}\ <\!{\overline {\mathrm {s} }}(c),\,{\overline {\mathrm {s} }}(b)\!>\ =\ <\!2,\,1\!>\ \in \ I_{\mathfrak {M}}(\mathrm {F} )\ .\,\!

Corresponding to (2) through (6) respectively:

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \not \vDash \mathrm {F} (a,a))\ \ {\mbox{because}}\ <\!{\overline {\mathrm {s} }}(a),\,{\overline {\mathrm {s} }}(a)\!>\ =\ <\!0,\,0\!>\ \notin \ I_{\mathfrak {M}}(\mathrm {F} )\ .\,\!

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \mathrm {F} (a,f(a,b))\ \ {\mbox{because}}\ <\!{\overline {\mathrm {s} }}(a),\,{\overline {\mathrm {s} }}(f(a,b))\!>\ =\ <\!0,\,1\!>\ \in \ I_{\mathfrak {M}}(\mathrm {F} )\ .\,\!

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \not \vDash \mathrm {F} (f(a,b),a)\ \ {\mbox{because}}\ <\!{\overline {\mathrm {s} }}(f(a,b),\,{\overline {\mathrm {s} }}(a)\!>\ =\ <\!1,\,0\!>\ \notin \ I_{\mathfrak {M}}(\mathrm {F} )\ .\,\!

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \mathrm {F} (c,b)\rightarrow \mathrm {F} (a,b)\ \ {\mbox{because}}\ <\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \mathrm {F} (a,b)\ .\,\!

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \not \vDash \mathrm {F} (c,b)\rightarrow \mathrm {F} (b,a)\ \ {\mbox{because}}\ <\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \mathrm {F} (c,b)\ {\mbox{but}}\ <\!{\mathfrak {M}},\ \mathrm {s} \!>\ \not \vDash \mathrm {F} (b,a)\ .\,\!

As noted above, the details of $\mathrm {s} \,\!$ were not relevant to these evaluations. But for similar formulae using free variables instead of constant symbols, the details or $\mathrm {s} \,\!$ do become relevant. Examples based the above are:

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \mathrm {F} (x,y)\ \ {\mbox{because}}\ <\!{\overline {\mathrm {s} }}(x),\,{\overline {\mathrm {s} }}(y)\!>\ =\ <\!0,\,1\!>\ \in \ I_{\mathfrak {M}}(\mathrm {F} )\ .\,\!

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \mathrm {F} (y,z)\ \ {\mbox{because}}\ <\!{\overline {\mathrm {s} }}(y),\,{\overline {\mathrm {s} }}(z)\!>\ =\ <\!1,\,2\!>\ \in \ I_{\mathfrak {M}}(\mathrm {F} )\ .\,\!

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \mathrm {F} (z,y)\ \ {\mbox{because}}\ <\!{\overline {\mathrm {s} }}(z),\,{\overline {\mathrm {s} }}(y)\!>\ =\ <\!2,\,1\!>\ \in \ I_{\mathfrak {M}}(\mathrm {F} )\ .\,\!

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \not \vDash \mathrm {F} (x,x))\ \ {\mbox{because}}\ <\!{\overline {\mathrm {s} }}(x),\,{\overline {\mathrm {s} }}(x)\!>\ =\ <\!0,\,0\!>\ \notin \ I_{\mathfrak {M}}(\mathrm {F} )\ .\,\!

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \mathrm {F} (x,f(x,y))\ \ {\mbox{because}}\ <\!{\overline {\mathrm {s} }}(x),\,{\overline {\mathrm {s} }}(f(x,y))\!>\ =\ <\!0,\,1\!>\ \in \ I_{\mathfrak {M}}(\mathrm {F} )\ .\,\!

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \not \vDash \mathrm {F} (f(x,y),x)\ \ {\mbox{because}}\ <\!{\overline {\mathrm {s} }}(f(x,y),\,{\overline {\mathrm {s} }}(x)\!>\ =\ <\!1,\,0\!>\ \notin \ I_{\mathfrak {M}}(\mathrm {F} )\ .\,\!

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \mathrm {F} (z,y)\rightarrow \mathrm {F} (x,y)\ \ {\mbox{because}}\ <\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \mathrm {F} (x,y)\ .\,\!

<\!{\mathfrak {M}},\ \mathrm {s} \!>\ \not \vDash \mathrm {F} (z,y)\rightarrow \mathrm {F} (y,x)\ \ {\mbox{because}}\ <\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \mathrm {F} (z,y)\ {\mbox{but}}\ <\!{\mathfrak {M}},\ \mathrm {s} \!>\ \not \vDash \mathrm {F} (y,x)\ .\,\!

Examples with quantifiers

Given model ${\mathfrak {M}}\,\!$ , the previous page also noted the following further goals:

(7)\quad \forall x\,\forall y\,(\mathrm {F} (x,y)\rightarrow \mathrm {F} (y,x))\ {\mbox{is false in }}\ {\mathfrak {M}}\ .\,\!

(8)\quad \exists x\,\exists y\,(\mathrm {F} (x,y)\land \mathrm {F} (y,x))\ {\mbox{is true in}}\ {\mathfrak {M}}\ .\,\!

Again, we are not yet ready to evaluate for truth or falsity, but again we can take a step in that direction by seeing that the sentence in (7) is and the sentence in (8) is not satisfied by ${\mathfrak {M}}\,\!$ with $\mathrm {s} .\,\!$

Corresponding to (7):

(9)\quad <\!{\mathfrak {M}},\ \mathrm {s} \!>\ \not \vDash \forall x\,\forall y\,(\mathrm {F} (x,y)\rightarrow \mathrm {F} (y,x))\,\!

is true if and only if at least one of the following is true:

(10)\quad <\!{\mathfrak {M}},\ \mathrm {s} [x\!:\,0]\!>\ \not \vDash \forall y\,(\mathrm {F} (x,y)\rightarrow \mathrm {F} (y,x))\,\!

(11)\quad <\!{\mathfrak {M}},\ \mathrm {s} [x\!:\,1]\!>\ \not \vDash \forall y\,(\mathrm {F} (x,y)\rightarrow \mathrm {F} (y,x))\,\!

(12)\quad <\!{\mathfrak {M}},\ \mathrm {s} [x\!:\,2]\!>\ \not \vDash \forall y\,(\mathrm {F} (x,y)\rightarrow \mathrm {F} (y,x))\,\!

The formula of (7) and (9) is satisfied by $<\!{\mathfrak {M}},\ \mathrm {s} \!>\,\!$ if and only if it is satified by ${\mathfrak {M}}\,\!$ with each of the modified variable assignments. Turn this around, and we get the formula failing to be satisfied by $<\!{\mathfrak {M}},\ \mathrm {s} \!>\,\!$ if and only if it fails to be satisfied by the model with at least one of the three modified variable assignments as per (10) through (12). Similarly, (10) is true if and only if at least one of the following are true:

<\!{\mathfrak {M}},\ \mathrm {s} [x\!:\,0,\ y\!:\,0]\!>\ \not \vDash \mathrm {F} (x,y)\rightarrow \mathrm {F} (y,x)\,\!

<\!{\mathfrak {M}},\ \mathrm {s} [x\!:\,0,\ y\!:\,1]\!>\ \not \vDash \mathrm {F} (x,y)\rightarrow \mathrm {F} (y,x)\,\!

<\!{\mathfrak {M}},\ \mathrm {s} [x\!:\,0,\ y\!:\,2]\!>\ \not \vDash \mathrm {F} (x,y)\rightarrow \mathrm {F} (y,x)\,\!

Indeed, the middle one of these is true. This is because

<\!0,\,1\!>\ \in \ I_{\mathfrak {M}}(\mathrm {F} )\ {\mbox{but}}\,<\!1,\,0\!>\ \not \in \ I_{\mathfrak {M}}(\mathrm {F} )\ .\,\!

Thus (9) is true.

Corresponding to (8),

(13)\quad <\!{\mathfrak {M}},\ \mathrm {s} \!>\ \vDash \exists x\,\exists y\,(\mathrm {F} (x,y)\land \mathrm {F} (y,x))\,\!

is true if and only if at least one of the following is true:

<\!{\mathfrak {M}},\ \mathrm {s} [x\!:\,0]\!>\ \vDash \exists y\,(\mathrm {F} (x,y)\land \mathrm {F} (y,x))\,\!

<\!{\mathfrak {M}},\ \mathrm {s} [x\!:\,1]\!>\ \vDash \exists y\,(\mathrm {F} (x,y)\land \mathrm {F} (y,x))\,\!

<\!{\mathfrak {M}},\ \mathrm {s} [x\!:\,2]\!>\ \vDash \exists y\,(\mathrm {F} (x,y)\land \mathrm {F} (y,x))\,\!

The middle of these is true if and only if at least one of the following are true:

<\!{\mathfrak {M}},\ \mathrm {s} [x\!:\,1,\ y\!:\,0]\!>\ \vDash \mathrm {F} (x,y)\land \mathrm {F} (y,x)\,\!

<\!{\mathfrak {M}},\ \mathrm {s} [x\!:\,1,\ y\!:\,1]\!>\ \vDash \mathrm {F} (x,y)\land \mathrm {F} (y,x)\,\!

<\!{\mathfrak {M}},\ \mathrm {s} [x\!:\,1,\ y\!:\,2]\!>\ \vDash \mathrm {F} (x,y)\land \mathrm {F} (y,x)\,\!

Indeed, the last of these is true. This is because:

<\!1,\,2\!>\ \in \ I_{\mathfrak {M}}(\mathrm {F} )\ {\mbox{and}}\,<\!2,\,1\!>\ \in \ I_{\mathfrak {M}}(\mathrm {F} )\ .\,\!

Thus (13) is true.

This article is issued from Wikibooks. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.