Determine whether the statement forms are logically equivalent. In each case, construct a truth table and include a sentence justifying your answer. Your sentence should show that you understand the meaning of logical equivalence. pOq = (p v q)A ~(p^ q). (p v q) v (p A r) and (p v q) ^ r ~(p A q) and ~p v ~q

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
icon
Related questions
Question

P,

> Determine whether the statement forms are logically equivalent. In each
case, construct a truth table and include a sentence justifying your answer.
Your sentence should show that you understand the meaning of logical
equivalence.
p O q = (p v q)^ ~(p ^ q).
(pvq)v (р лr) and (p V q)лг
~(p A q) and ~p v ~q
Easily add text in PDF
Add
Question 06
• Use truth tables to verify the following logical equivalences. Include a few
words of explanation with your answers.
p →q = ~p V q
а.
b. p →q = (p^ ~q) →(r ^ ~r)
c. ~(p →q) = p ^ ~q.
d. pg3 (р — q)л (q — р)
Question 07
> Determine whether the statement forms are Tautology using Logic Algebra.
(p A q) → p
a.
b. -р — (р — q)
р — (руq)
c.
Question 08
• Determine whether the statement forms are logically equivalent using Logic
Algebra.
> P→ q = ¬q → -p
(PA Q) V (PA ~Q) V (~P^ ~Q) = PV ~Q
• ~(~p ^ q) ^ (p v q) = p
Bonus
Transcribed Image Text:> Determine whether the statement forms are logically equivalent. In each case, construct a truth table and include a sentence justifying your answer. Your sentence should show that you understand the meaning of logical equivalence. p O q = (p v q)^ ~(p ^ q). (pvq)v (р лr) and (p V q)лг ~(p A q) and ~p v ~q Easily add text in PDF Add Question 06 • Use truth tables to verify the following logical equivalences. Include a few words of explanation with your answers. p →q = ~p V q а. b. p →q = (p^ ~q) →(r ^ ~r) c. ~(p →q) = p ^ ~q. d. pg3 (р — q)л (q — р) Question 07 > Determine whether the statement forms are Tautology using Logic Algebra. (p A q) → p a. b. -р — (р — q) р — (руq) c. Question 08 • Determine whether the statement forms are logically equivalent using Logic Algebra. > P→ q = ¬q → -p (PA Q) V (PA ~Q) V (~P^ ~Q) = PV ~Q • ~(~p ^ q) ^ (p v q) = p Bonus
equivalences hold.
1. Commutative laws: p Aq = q ap
pv q = q vp
2. Associative laws: (p a q) Ar =p^ (qAr)
(p v q) vr = p v (q v r)
3. Distributive laws: p ^ (q v r) = (p ^ q) v (p ar)
p v (q ar) = (p v q) ^ (p v r )
4. Identity laws: p At =p
pv c = p
5. Negation laws: p v ~p = t
pA ~p = c
6. Double negative law: ~(~p) = p
7. Idempotent laws: p ^p =p
pv p = p
8. Universal bound laws: p v t = t
pAC=C
9. De Morgan's laws: ~(p ^ q) = ~p V ~q
- (p v q) = ~p A ~q
10. Absorption laws: p v (p A q) =p
pA (p v q) = p
11. Negations of t and c: ~t = c
-C = t
12. Removing implication: p → q = -p v q
-(p → q) = p A ng
Table 1
Question 05
• Determine whether the statement forms are logically equivalent. In each
case, construct a truth table and include a sentence justifying your answer.
Your sentence should show that you understand the meaning of logical
equivalence.
p O q = (p v q)^ ~(p ^ q).
(p v q) v (p Ar) and (p v q)ar
~(p ^ q) and ~p v ~q
Question 06
• Use truth tables to verify the following logical equivalences. Include a few
words of explanation with your answers.
p →q = ~p V q
a.
b. p →q = (p^ ~q) →( r ^ ~r)
~(р —q) %3D р л ~д.
C.
d. p
q = (p- q) A (q → p)
Question 07
> Determine whether the statement forms are Tautology using Logic Algebra.
а. (рлд) —р
b. -р — (р — q)
p - (p v g)
c.
Transcribed Image Text:equivalences hold. 1. Commutative laws: p Aq = q ap pv q = q vp 2. Associative laws: (p a q) Ar =p^ (qAr) (p v q) vr = p v (q v r) 3. Distributive laws: p ^ (q v r) = (p ^ q) v (p ar) p v (q ar) = (p v q) ^ (p v r ) 4. Identity laws: p At =p pv c = p 5. Negation laws: p v ~p = t pA ~p = c 6. Double negative law: ~(~p) = p 7. Idempotent laws: p ^p =p pv p = p 8. Universal bound laws: p v t = t pAC=C 9. De Morgan's laws: ~(p ^ q) = ~p V ~q - (p v q) = ~p A ~q 10. Absorption laws: p v (p A q) =p pA (p v q) = p 11. Negations of t and c: ~t = c -C = t 12. Removing implication: p → q = -p v q -(p → q) = p A ng Table 1 Question 05 • Determine whether the statement forms are logically equivalent. In each case, construct a truth table and include a sentence justifying your answer. Your sentence should show that you understand the meaning of logical equivalence. p O q = (p v q)^ ~(p ^ q). (p v q) v (p Ar) and (p v q)ar ~(p ^ q) and ~p v ~q Question 06 • Use truth tables to verify the following logical equivalences. Include a few words of explanation with your answers. p →q = ~p V q a. b. p →q = (p^ ~q) →( r ^ ~r) ~(р —q) %3D р л ~д. C. d. p q = (p- q) A (q → p) Question 07 > Determine whether the statement forms are Tautology using Logic Algebra. а. (рлд) —р b. -р — (р — q) p - (p v g) c.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Binary numbers
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education