Back to the course home page

Recommended Homework

12/3

Show that

(x)(Px Qc) (x)Px Qc

12/1

pg. 355-6

11/29

pg 359-61, some of #'s 1,2,3

11/22

pg 351

11/19

pg 342-4, some of #1-2, 7-9
some of #3-5
#6

11/1

If you aren't confident with the rules of sentential proof, you should work through some of the problems in Chapter 5.

For the simpler quantifier rules: any and all on pgs. 446, 447-8

11/3

any of pgs. 452, 456-7, 458-62

11/5

pgs. 478-484, 486-488

11/10

pgs. 491-2

10/4

Which pairs of symbols could you use to build a language equivalent to SL?
Is there any equivelent language with just one connective?

You can play around with possibilities, but here's a hint: and & will work.
So will and v.
and will not.

No one of the standard connectives will do alone, but try, for instance, the Sheffer Stroke:

A	B	A | B
T	T	F
T	F	T
F	T	T
F	F	T

10/4

pgs. 53-4, #5

pgs. 83-4, #3

10/8

pgs. 257-9, all

10/13

pg. 288, #2

10/15

pg. 273-4, #1-2

10/18

pgs. 304-6, any of #1-4
pgs. 318-9 any of #1-3

You will have to symbolize some sentences on the exam by making your own key, so I recommend that you try a few of these problems without looking at the symbolization key in the book.

10/20

pgs. 329-31, #1 and #4