I. Complete the proof by writing in the appropriate justification (rule and line numbers) for the sentences on lines 4 through 7.
1. | A (B v C) | assum. |
2. | ~B | assum. |
want ~C ~A | ||
3. | ~C | assum. |
want ~A | ||
4. | ~B & ~C | &I, 2, 3 |
5. | ~(B v C) | DeM, 4 |
6. | ~A | MT, 1, 5 |
7. | ~C ~A | I, 3-6 |
II. Derive: B
1. | A (B & C) | assum. |
2. | A | assum. |
want B | ||
3. | B & C | E, 1, 2 |
4. | B | &E, 3 |
Symbolize the following argument using the symbolization key provided. Assuming the premise, provide a proof of the conclusion.
UD: everything, everyone, etc.
Cxy: x created y
g: God
1. | (x) Cgx | assum. |
want (x) Cxg | ||
2. | Cgg | E, 1 |
3. | (x) Cxg | I, 2 |
1. | (x) (y) Rxy | assum. |
want (x) Rxc | ||
2. | (y) Ray | assum. |
want (x) Rxc | ||
3. | Rac | E,2 |
4. | (x) Rxc | I, 3 |
5. | (x) Rxc | E, 1, 2-4 |
1. | (x) (Wx x=j) | assum. |
2. | Wa & Ja | assum. |
want Jj | ||
3. | Wa a=j | E,1 |
4. | Wa | &E, 2 |
5. | a=j | E, 3, 4 |
6. | Ja | &E, 2 |
7. | Jj | =E, 5, 6 |
Show that
is quantificationally indeterminate.
Consider the model:
And the model:
The sentence is true in the first model and false in the second. Thus, it is indeterminate.