3- If statement forms P and Q are logically equivalent, then P + Q is a tautology. Conversely, if P Q is a tautology, then P and Q are logically equivalent. Use ↔ to convert each of the following logical equivalences to a tautology. Then use a truth table to verify each tautology. (a) p ^ (qVr) = (p^q) V (p^r) (b) p→ (q+r) = (p^q) → r

3- If statement forms P and Q are logically equivalent, then P + Q is a tautology. Conversely, if P Q is a tautology, then P and Q are logically equivalent. Use ↔ to convert each of the following logical equivalences to a tautology. Then use a truth table to verify each tautology. (a) p ^ (qVr) = (p^q) V (p^r) (b) p→ (q+r) = (p^q) → r

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

Problem 5: Show that each of the following statements is a tautology by using truth tables. 1. (рлд) -> (р—) 2. - (p→ q) →p 3. — (р —9) —> -9 4. [p ^ (p → q)]→ q 5. [(p v q) ^ (p →r) ^ (q → r)] →r Problem 6: Determine whether (¬p^ (p → q)) →¬ q is a tautology.
1. Show that (p ∧ q) → r and (p → r) ∧ (q → r) is logically equivalent.
37. Construct a truth table for each of these compound propc sitions. a) p (¬q Vr) b) -p (q→r) c) (p → q) V (-p → r). d) (p q) ^ (¬p →r) e) (p q) V (¬g → r). f) (-p → ¬q) → (q → r) + (q → r).
Problem 1. Use the Boolean algebra derivation (instead of truth table) to prove or answer the questions. p↔q = (p→q)^ (q→→p) pvq-(p→q) →q (p+q)' =p' q Is ((p = q)) ((pr) ➡(qr)) a tautology, why? Provide the proof or disproof. Is (p q) (p →q) a tautology, why? Provide the proof or disproof.
1. Using the truth table Determine whether: a) (¬p → ¬q ) ∨ (p → ¬q) is equivalent to p ∨ ¬p b) ¬p ∨ (p ˄ q) is equivalent to p ↔ ¬q 2. Show the following statement is contraction, a tautology, or neither. (p→(q→r))↔ (p ˄ q →r) SHOW YOUR WORK AND ANSWER ALL QUESTIONS PLEASE!
5) Prove [¬(p→q)→p] is a tautology using a truth table. [Hints: Complete the truth table below and show that [¬(p→q)→p] is a tautology] p→q ¬(p→q) ¬(p→q)→p
We have shown how to use truth tables to determine if two formulas are truth-functionally equivalent.If two formulas F and G are truth-functionally equivalent we introduce another symbol ↔, aptly called thebiconditional. Here is the truth table for the biconditional.p q (p ↔ q)1 1 11 0 00 1 00 0 1Now we shall say that F and G are truth-functionally equivalent if (F ↔ G) is a tautology.There are other properties of two formulas that we are usually interested in besides truth-functionalequivalence. One of these properties is when two formulas are mutually exclusive. We say two formulas Fand G are mutually exclusive if (F ∧ G) is contradictory (unsatisfiable).Now using truth tables determine whether the following formulas are truth-functionally equivalent or mutuallyexclusive.(a) p and ¬p (b) p and ¬¬p (c) ¬(p ∧ ¬q) and (p → q) (d) (¬p ∨ q) and (p → q) (e) ¬(¬p ∨ ¬q) and (p ∧ q) (f) ¬(¬p ∧ ¬q) and (p ∨ q)
37. Construct a truth table for each of these compound sitions. a) p→ (q Vr) b) ¬p → (q→ r) c) (p→q) v (¬p → r) d) (p→q)^(-p → r) e) (pq) v (¬q ↔r) f) (p¬q) → (q ↔r)
1. Write the & function of the following (1) dfa ( DFA : Q×2→Q) and (2) nfa ( 8 NFA 4:Qx(EU{2})→P(Q) ) respectively, where E={a,b}. (1) a, b b 90 a a,b
Complete the truth table and determine whether or not the following statement is a tautology, a contradiction, or neither. ~(~p^g) ^ (p V q) ITT pq ~pq~(~p^q) pVq~(~p ^ q) ^ (pVg) T ITIT T T TF T IFIT |||
Construct a truth table 0 = F and 1 = T then indicate when it is Tautology, Contradiction or neither (~P- ³➜~Q)→→((~P➜Q)→P)
Select the following statements that are true. (pVq) ^ (pV¬q) = (p^¬q) V (p^q) ¬(pq) = (p^¬q) P→→q is the converse of q→→ p ¬(p ^ q) = (-p) ^ (q) ¬p → (q V ¬p) is a tautology