

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Material Type: Assignment; Class: Discrete Structures; Subject: Computer Science; University: University of Illinois - Urbana-Champaign; Term: Fall 2008;
Typology: Assignments
1 / 2
This page cannot be seen from the preview
Don't miss anything!


CS 173 Homework 1 (due 9/5/08 in class) Fall 2008
(a) Either the Chicago White Sox pitching improves and they continue to hit well or the Minnesota Twins will win the division. (b) Discrete mathematics is interesting and has many useful applications or the students will not be happy.
(a) (¬p → (q → r)) ≡ (q → (p ∨ r)) (b) ¬(p → ¬q) ∧ ¬(p ∨ q) is a contradiction (i.e. always false). (c) (4 points) (p ∨ q) ∧ (¬p ∨ r) → (q ∨ r) is a tautology (i.e. always true)
Babbage: Both De Morgan and I are authentic. De Morgan: Babbage is a charlatan
What kind of people are De Morgan and Babbage? Justify your answer.
(a) State the negation of the statement “I have overslept or the building is on fire”, using deMorgan’s laws to move the negation from the whole thing onto the two component statements. (b) Using your result from part (a), write the negation, contrapositive, converse and inverse of the following statement (see page 8 of the textbook for a related example). If I have overslept or the building is on fire, then the class will be canceled.
CS 173 Homework 1 (due 9/5/08 in class) Fall 2008
p q p ↑ q p ↓ q T T F F T F T F F T T F F F T T
(a) The set of operators {∧, ∨, ¬} is functionally complete , which means that every logical statement can be expressed using only these three operators. Is the smaller set of oper- ators {∨, ¬} also functionally complete? Explain why or why not. (b) Express ¬p using only the Sheffer stroke operation ↑. (c) Express p ∨ q using only the Sheffer stroke operation ↑. Justify your answer (e.g. using a truth table). (d) Explain why the set of operators {↑} is functionally complete. (e) (4 point bonus) Express the Sheffer stroke operation p ↑ q using only the Peirce arrow ↓ operation. Explain why the set of operators {↓} is functionally complete.