Quiz Answers for CSE 260-001: Proofs and Logic, Quizzes of Discrete Structures and Graph Theory

Answers to quiz 5 for cse 260-001, a university-level course on proofs and logic. The proof of the tautology of p ∧ (p → q) → q and the formal proof that (c) follows from (a) and (b) in the given text.

Typology: Quizzes

Pre 2010

Uploaded on 07/28/2009

koofers-user-64n
koofers-user-64n 🇺🇸

10 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CSE 260- 001
QUIZ-5– Proofs - ANSWER
(30 points/ 20 minutes)
NAME:
1. (6 points) Show that pqis proved by showing q true.
Hint: if q is true you have to consider the following two cases:
p q
--------
T T
F T
p=T and q=T gives pq=T
p=F and q=I gives pq=T
2. (6 points) Let P,Qand Rbe three compund propositions. Consider the following
general description of an inference rule:
P
Q
Therefore, R
Above inference rule makes the statement PQRa tautology because when P,
Qare true Ris true (from the inference rule) and the statement is true; for the other
cases one of Por Qwill be false and the statement is also true.
Consider the inference rule Modus ponens:
p
pq
therefore, q
Show by truth table p(pq)qis a tautology.
p q p q p (pq)p(pq)q
T T T T T
T F F F T
F T T F T
F F T F T
You are given the following statements:
3. a) All clear explanations are satisfactory.
b) Some excuses are unsatisfactory.
c) Some excuses are not clear explanations.
Prove formally that (c) follows from (a) and (b).
pf2

Partial preview of the text

Download Quiz Answers for CSE 260-001: Proofs and Logic and more Quizzes Discrete Structures and Graph Theory in PDF only on Docsity!

CSE 260- 001

QUIZ-5– Proofs - ANSWER

(30 points/ 20 minutes)

NAME:

  1. (6 points) Show that p → q is proved by showing q true. Hint: if q is true you have to consider the following two cases:

p q

T T F T

p=T and q=T gives p → q = T p=F and q=I gives p → q = T

  1. (6 points) Let P , Q and R be three compund propositions. Consider the following general description of an inference rule: P Q Therefore, R Above inference rule makes the statement P ∧ Q → R a tautology because when P , Q are true R is true (from the inference rule) and the statement is true; for the other cases one of P or Q will be false and the statement is also true. Consider the inference rule Modus ponens: p p → q therefore, q Show by truth table p ∧ (p → q) → q is a tautology. p q p → q p ∧ (p → q) p ∧ (p → q) → q

T T T T T

T F F F T

F T T F T

F F T F T

You are given the following statements:

  1. a) All clear explanations are satisfactory. b) Some excuses are unsatisfactory. c) Some excuses are not clear explanations. Prove formally that (c) follows from (a) and (b).

I. (6 points) Assuming that the universe of discourse U is the set of all English text, define the basic predicates. C(x): “x is a clear explanation,” S(x): “x is satisfactory,” E(x): “x is an excuse.” II. (4 points) State the hypotheses using quantifiers and the above predicates. a) ∀x C(x) → S(x) b) ∃x E(x) ∧ ¬S(x)

III. (2 points) State the conclusion using quantifiers and the above predicates.

∃x E(x) ∧ ¬C(x) IV. (8 points) Give a formal proof that the conclusion follows from the hypotheses. DO NOT FORGET TO JUSTIFY EACH STEP!

  1. ∃x E(x) ∧ ¬S(x) Hypothesis (b)
  2. E(c) ∧ ¬S(c) for some c in U Existential Instantiation (E.I.) (step 1)
  3. E(c) Simplification (step 2)
  4. ¬S(c) Simplification (step 2)
  5. ∀x C(x) → S(x) Hypothesis (a)
  6. C(c) → S(c) Universal Instantiation (U.I.) (step 5)
  7. ¬C(c) Modus tollens (steps 4, 6)
  8. E(c) ∧ ¬C(c) Conjunction (steps 3, 7)
  9. ∃x E(x) ∧ ¬C(x) Existential Generalization (E.G.) (step 8)