Week 1

Create a star "venn diagram" on the circle paper in which either 3,4, or 5 regions are colored.  All regions with the same code, i.e., 011 or 101, etc. are give the same color.  Translate your diagram into a truth table where the colored regions are true and the uncolored are false values of the statement.

Extra credit:  create and interesting star diagram using color. 

page 8/1-4,

page 23/1a,b,c,2-5,10a, 11c,d

Handout:  7,8,9

To do problem 9 of the the handout you should note that there are several different translations

of p-->q.  Here they are:

  if p then q

  if p, q

p is sufficient for q

q if p

q whenever p

q is necessary for p

q follows from p

p implies q

p only if q

Week 2

9/11

Read the handout on the "new logic"

Use a truth table with the mark to show that the truth table for (not p or q) gives you the same result as

p-->q

*  Show using the new Boolean algebra that :   (p and (p-->q))-->q  = 1

*show using the new Boolean algebra that   r-->(p-->q) = (r and p) --> q

Use the new Boolean algebra to do:  Section 1.2 / 2a, 4, 5a

Use truth tables with the mark and the blank to do Sec. 1.2/ 2a,4,5a

Remember that  aⁿ = a where n is any positive integer.

Do the handout problem 47 (another consistency problem)

9/15

29/3a*,5c*,f,d (do this for extra credit), 6*

Prove:  ((p-->q) and (q-->r)) --> (p--r) = T   (hypothetical syllogism)

Do Ladies Luncheon problem from classnotes (for extra credit)

Come to the Technology and society Forum on Wed. and tell your friends about it.

9/18

Do ladies luncheon problem for extra credit

On handout do:

12* a,b,  f) (at top of page), 11 a,c* (use my shortcut method)

in the book for problem 30/10f * a) create the truth table by using boolean arithmetic, b) use the new boolean algebra to find the logic gates necessary to implement this function using 1) nand and not gates 2) nor and not gates

9/22

On handout do:  12 c,d,   11b,  problem g at the top of the page

Diagram syllogisms 9 and 10

Do 30/ 10 b draw the K-map and draw the gate diagrams with not and nor gates for the original logic statement and the simplified K-map.

34/ 3a,b,c

Read about quantifiers on page 5 and 6 and do problem on page 9/ 7a-h

I would like you to write a two page essay responding to Essay 1 on the M226 class notes on the web.

Short quiz on Thursday

9/25

Read Section 2.1 and do:

1,3,5,7,9

Bring in your essay.

9/28

Please read Sections 2.1 and 2.2.  I will send the hw problems to you later in an e-mail. 

Week 5

10/2

Do 2.3/1,2

Read chapter and try to do 2.3/3

Study for exam which will cover Sections 1.1, 1.2, 1.3, 2.1, 2.2

Week 6

10/9

I will send your homework through the e-mail.  If you don't get it please e-mail me.