Homework 1 Problems - Discrete Mathematical Structures | CS 173, Assignments of Discrete Structures and Graph Theory

Material Type: Assignment; Class: Discrete Structures; Subject: Computer Science; University: University of Illinois - Urbana-Champaign; Term: Fall 2008;

Typology: Assignments

Pre 2010

Uploaded on 03/11/2009

koofers-user-92n
koofers-user-92n 🇺🇸

9 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CS 173 Homework 1 (due 9/5/08 in class) Fall 2008
CS 173: Discrete Mathematical Structures, Spring 2008
Homework 1
Due in class on Friday, September 5, 2008
Grading: The point values of the problems add up to 50 points.
1. [10 points] Translate the following sentences into propositional logic, making the meaning
of your propositional variables clear, and then create a truth table for each sentence. See
page 11 of the textbook for some examples of translating English sentences into propositional
logic.
(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.
2. [4 points] Use a truth table to show that the following logical equivalence is correct
¬((pp)q)(pq)
3. [10 points] In the following exercises, use the logical equivalences given on pages 24 and 25
of the textbook (in Tables 6 through 8) to show that:
(a) (¬p(qr)) (q(pr))
(b) ¬(p ¬q) ¬(pq)is a contradiction (i.e. always false).
(c) (4 points) (pq)(¬pr)(qr)is a tautology (i.e. always true)
4. [5 points] Assume that there are only two kinds of people, a person is either authentic or a
charlatan. A person is authentic if and only if every statement they make is true. A person is
a charlatan if and only if every statement they make is false. Suppose you meet Augustus De
Morgan and Charles Babbage in class one day and they say the following:
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.
5. [5 points]
(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.
1
pf2

Partial preview of the text

Download Homework 1 Problems - Discrete Mathematical Structures | CS 173 and more Assignments Discrete Structures and Graph Theory in PDF only on Docsity!

CS 173 Homework 1 (due 9/5/08 in class) Fall 2008

CS 173: Discrete Mathematical Structures, Spring 2008

Homework 1

Due in class on Friday, September 5, 2008

Grading: The point values of the problems add up to 50 points.

  1. [10 points] Translate the following sentences into propositional logic, making the meaning of your propositional variables clear, and then create a truth table for each sentence. See page 11 of the textbook for some examples of translating English sentences into propositional logic.

(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.

  1. [4 points] Use a truth table to show that the following logical equivalence is correct ¬((p ∧ p) ⊕ q) ≡ (p ↔ q)
  2. [10 points] In the following exercises, use the logical equivalences given on pages 24 and 25 of the textbook (in Tables 6 through 8) to show that:

(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)

  1. [5 points] Assume that there are only two kinds of people, a person is either authentic or a charlatan. A person is authentic if and only if every statement they make is true. A person is a charlatan if and only if every statement they make is false. Suppose you meet Augustus De Morgan and Charles Babbage in class one day and they say the following:

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.

  1. [5 points]

(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

  1. [16 points] The late 19th century philosopher Charles Peirce (rhymes with ‘hearse,’ not ‘fierce’) wrote about a set of logically dual operators and, in his writings, coined the term ‘Ampheck’ to describe them. The two most common Ampheck operators, the Peirce arrow (written ↓ or ⊥ or ∨ by different people) and the Sheffer stroke (written ↑ or | or ∧ by differ- ent people), are defined by the following truth table:

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.