Consider the following “proof" 1: a ^ (¬a → b) (Premise) 2: a ^ (¬a V b) (Implication, 1) 3: (a ^ ¬a) V b (Associative, 2) 4: T V b (Negation, 3) 5: T (Identity, 4) (a) Identify all of the errors in the proof. (b) Using Rules of Inference and Propositional Equivalences, formally prove that a ^ (¬a → b) = a

Consider the following “proof" 1: a ^ (¬a → b) (Premise) 2: a ^ (¬a V b) (Implication, 1) 3: (a ^ ¬a) V b (Associative, 2) 4: T V b (Negation, 3) 5: T (Identity, 4) (a) Identify all of the errors in the proof. (b) Using Rules of Inference and Propositional Equivalences, formally prove that a ^ (¬a → b) = a

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Question 2 (a) Propositional Logic Let F be the formula (AV B) - (B V A), and let G be the formula A (B → (¬B V ¬A)) → ¬B. 2 () Provide a constructive Sequent Calculus proof of F. (ii) Provide a constructive Natural Deduction proof of G. (iii) Is G satisfiable? Justify your answer.
Question 20 Determine the line and the reason for the entry on line 6 given the following part of a formal proof of validity: 1. E = (F A ¬G) 2. (F V G) = H 3. Е : H 4. F A¬G 5. F 6. F V G 7. Н A 1,2 HYPOTHETICAL SYLLOGISM 4,5 MATERIAL IMPLICATION 2 SIMPLIFICATION 5 ADDITION
Answer only question 15
Construct direct proofs to show that the following symbolic arguments are valid. Commas mark the breaks between premises. 1. ~(J∙L), (~J v ~L)→~M, ~E v (M v ~S) ∴ ~(S∙E) 2. (B∨A)→C, ~B→D, ~D ∴ C 3. ~(O∙N), (~O→S)∙(~N→T) ∴ S v T
Calculate (by hand) the appropriate truth table to prove the following: (¬q → ¬p) ∧ p ⇔ p ∧ q Explain why your truth table shows that this is an equivalence and prove it using the fundamental logical equivalences given in Tables 7.6–7.7 in the Unit Notes (reproduced below for convenience).[Hint: Start by using the contrapositive equivalence.]
Let p, q, and r be the propositions p: You started a new video game this week. q: You finished all its quests.r: You didn’t win the platinum trophy.Express each of these propositions as an English sentence.¬p → ¬q(p ∧ q) → (¬r)((¬p) → (¬q)) ∨ (q → (¬r))(p ∧ q) ∨ (¬q ∧ r)
Construct a proof For each of the following proofs, I've set up the premises. You need add lines and justifications to reach the conclusion. 7.9 VxRxx, (³xRxy → Py) - Pc 1 AXRxx :PR 2 Ay (ExRxy->Py) :PR vx(Bx v Mx), ¬³XBX VXMX 1 Ax (Bx v Mx) 2 -ExBx : PR :PR
Please answer question 2 thank you
Use semantic tableau and truth tables (2 separate proofs) to determine whether the conclusion of the following argument follows from the premises. P→ (¬H→C) (P→ ¬H)/(P→ C)
Show that the argument is valid, indicating the rule of inference or logical equivalence applicable to each step. ∃x ( C(x) ∧ ( ¬ S(x) → ( V(x) ∨ W(x) ) ) )∀x ( V(x) → ¬ C(x) )¬ ∃x ( W(x) ∧ C(x) ) _________________________∴ ∃x ( S(x) ∧ ¬ W(x) )
Assume the propositions p, q, r, and s have the following truth values:p : False (F). q : True (T). r : False (F). s : True (T). Evaluate the truth value for each of the following compound propositions. Show your work for yourevaluation.a) (p ∨ q) ∧ ¬ rb) p ∨ q ∧ ¬ rc) ¬(r ∨ s) → p ∨ qd) r ⊕ ¬s ↔ q → pe) (p ∧ ¬q) ⊕ (r → (¬s ∨ q))
Apply a series of logical equivalences and/or rules of inference to show that r → q follows from the following premises. Be sure to indicate the line number(s) and logical equivalence or rule of inference used in each step. 1. p → q 2. (r V s) → p 3. ¬s