Back to the course home page

Quizzes


Quiz #4, 11/3

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


Quiz #5, 11/5

Symbolize the following argument using the symbolization key provided. Assuming the premise, provide a proof of the conclusion.

God created everything and everyone.
Therefore, something or someone created God.

UD: everything, everyone, etc.
Cxy: x created y
g: God

1. | (Far allx) Cgx assum.
|--- want (Existsx) Cxg
2. | Cgg Far allE, 1
3. | (Existsx) Cxg ExistsI, 2


Quiz #6, 11/12

1. | (Existsx) (Far ally) Rxy assum.
|--- want (Existsx) Rxc
2. | | (Far ally) Ray assum.
| |--- want (Existsx) Rxc
3. | | Rac Far allE,2
4. | | (Existsx) Rxc ExistsI, 3
5. | (Existsx) Rxc ExistsE, 1, 2-4


Quiz #7, 11/15

1. | (Far allx) (Wx -> x=j) assum.
2. | Wa & Ja assum.
|--- want Jj
3. | Wa -> a=j Far allE,1
4. | Wa &E, 2
5. | a=j ->E, 3, 4
6. | Ja &E, 2
7. | Jj =E, 5, 6


Quiz #8, 12/1

Show that

Ha & (For allx)Px

is quantificationally indeterminate.

Consider the model:

UD = {me}
extension(H) = {me}
extension(P) = {me}
referent(a) = {me}

And the model:

UD = {me}
extension(H) = {me}
extension(P) = {}
referent(a) = {me}

The sentence is true in the first model and false in the second. Thus, it is indeterminate.