User:Gert

From English Grammar
Revision as of 12:23, 1 April 2017 by Gert (talk | contribs) (Created page with "<!-- This is a comment --> <!-- ∀''x'' ('''cat'''(''x'') : ∃''y''('''likes(''y'', ''x'')) --> <!-- ⊃ ∧ ¬ ∨ ≡ ∀ ∃ æ &...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Quantification


For the following exercises, assume the existence of a model with the universe of discourse below:

U = { cat1,cat2,cat3,dog1,dog2,dog3 }


Now do the following exercises about the interpretation function I of the model.


Exercise 1 For I(cat1) and I(lilly), specify one plausible value each so that the formula cat1(lilly) becomes true in M.

Check your answer

I(cat1) = {<cat1>,<cat2>,<cat3>}

For I(lilly), each of the following 3 values will now make cat1(lilly) true in M:
a. I(lilly) = cat1 , or
b. I(lilly) = cat2 , or
c. I(lilly) = cat3 .

We prove this for case (b):

1. [[cat1(lilly)]]M = 1 iff <[[lilly]]M> ∈ I(cat1)
2. iff <I(lilly)> ∈ I(cat1)
3. iff <cat2> ∈ {<cat1>,<cat2>,<cat3>}

Hence: since (3) is the case, so are (2) and the righthand side of (1). Finally, since the righthand side of (1) is the case, the lefthand side is the case as well. Hence [[cat1(lilly)]]M is true in model M. That is what we intended to prove!