MATH 520	INTERMEDIATE LOGIC	Line no: 43274
Instructor: Gábor Hetyei		Last update: November 7, 1999

Homework assignments

Disclaimer: The information below comes with no warranty. If, due to typocraphical error, there is a discrepancy between the exercise numbers announced in class and the numbers below, or this page is not completely up to date, the required homework consists of those exercises which were announced in class. Check for the time of last update above. If, by my mistake, a wrong exercise number shows up below, I will allow you extra time to hand in the exercise whose number was announced in class. If, however, exercise numbers are missing because this page is not up to date, it is your responsability to contact me before the due date. (No extra time will be allowed in that case.) This page is up to date if the last update happened after the last class before the next due date.

How to read this list:: E 2.1 means Exercise 1 from Chapter 2.
P 2.2 means Problem 2 from Chapter 2.
If there is a question in parantheses after the number, you need to hand in only the answer to that question.

Date due Exercises:

August 30, 1999 E 2.1 (do not hand it in), P 2.2 (do not hand it in), P 2.5, P 2.6, P 2.7. P 2.12, P 2.13, P 2.15.

September 8, 1999 P 2.24, P 3.4 (what is the maximum number of sentences that can be made true), P 3.6, P 3.8 (hand in the sentences only), P 3.9, P 3.10, P 3.18/4.

September 13, 1999 P 3.19, P 3.22/1,4, P 3.34 (check for every row of the truth table that the conclusion evaluates to "true" whenever all premises are true), P 3.37 (give short informal proofs, using proof by cases or proof by contradiction).

September 20, 1999 P 3.41 (fill in the blanks), 3.40/1,2,3 (in 2 you will have to use Trans Id), 3.46/1 (formal proof only, mirroring the informal proof presented in class).

September 27, 1999 P 3.52, P 3.56, P 3.59.
Bonus question: Is it possible to express (A and B) using negation and exclusive or?

October 4, 1999 P 4.3, P 4.4 (you may want to do P 4.6 to check your answers). P 4.18 (give informal proof or a counterexample), P 3.42 (hint: do a proof by contradiction), P 4.16/2,3 (do both formal and informal proofs).

October 11, 1999 P 4.29/1, P 5.1 (add only parentheses), P 5.2 (add only quantifiers), P 5.3 (major corrections needed), P 4.20/4. Check out also E 5.4 and E 5.5 (but do not hand in anything on them).

October 18, 1999 P 5.8 (answers only), P 5.10, P 5.19, E 5.7 (will not be graded), P 5.9, P 5.26.

October 25, 1999 P 5.41/1,3, P 5.36, P 6.9, P 6.19, P 6.14.
Bonus question: Prove (informally) or disprove (by giving an example) the equivalence of the following two statements:
1. Forall x (Not Exists y BackOf(y,x) -> Cube(x))
2. Forall x Exists y (Not BackOf(y,x) -> Cube(x))

November 1, 1999 P 6.20/7-10, 6.28, 6.34

November 8, 1999 P 6.47, P 6.46/3,4. Bonus: P 6.48.

Date due	Exercises:
August 30, 1999	E 2.1 (do not hand it in), P 2.2 (do not hand it in), P 2.5, P 2.6, P 2.7. P 2.12, P 2.13, P 2.15.
September 8, 1999	P 2.24, P 3.4 (what is the maximum number of sentences that can be made true), P 3.6, P 3.8 (hand in the sentences only), P 3.9, P 3.10, P 3.18/4.
September 13, 1999	P 3.19, P 3.22/1,4, P 3.34 (check for every row of the truth table that the conclusion evaluates to "true" whenever all premises are true), P 3.37 (give short informal proofs, using proof by cases or proof by contradiction).
September 20, 1999	P 3.41 (fill in the blanks), 3.40/1,2,3 (in 2 you will have to use Trans Id), 3.46/1 (formal proof only, mirroring the informal proof presented in class).
September 27, 1999	P 3.52, P 3.56, P 3.59. Bonus question: Is it possible to express (A and B) using negation and exclusive or?
October 4, 1999	P 4.3, P 4.4 (you may want to do P 4.6 to check your answers). P 4.18 (give informal proof or a counterexample), P 3.42 (hint: do a proof by contradiction), P 4.16/2,3 (do both formal and informal proofs).
October 11, 1999	P 4.29/1, P 5.1 (add only parentheses), P 5.2 (add only quantifiers), P 5.3 (major corrections needed), P 4.20/4. Check out also E 5.4 and E 5.5 (but do not hand in anything on them).
October 18, 1999	P 5.8 (answers only), P 5.10, P 5.19, E 5.7 (will not be graded), P 5.9, P 5.26.
October 25, 1999	P 5.41/1,3, P 5.36, P 6.9, P 6.19, P 6.14. Bonus question: Prove (informally) or disprove (by giving an example) the equivalence of the following two statements: 1. Forall x (Not Exists y BackOf(y,x) -> Cube(x)) 2. Forall x Exists y (Not BackOf(y,x) -> Cube(x))
November 1, 1999	P 6.20/7-10, 6.28, 6.34
November 8, 1999	P 6.47, P 6.46/3,4. Bonus: P 6.48.