1.(a). logic equiva (pag)v(: pag)v(pn: q)= pvq (b) Use Theorem 2.1.1 provided to you on exam paper to verify the given logical equivalence. Give a reason from the Theorem for each step in your proof. Theorem 2.1.1 Logical Equivalences Given any statement variables p, q, and r, a tautology t and a contradiction e, the following logical equivalences hold. p vq =q V p (p v q) vr = pv (q vr) p v (q ar) = (p vq) A (p vr) 1. Commutative laws: png =qAp 2. Associative laws: (pAq) Ar = p (a ar) 3. Distributive laws: pa (g vr) = (p ng) v (par) 4. Identity laws: 5. Negation laws: pat= p pVC= p pv ~p =t 6. Double negative law: (~p) = p 7. Idempotent laws: pvp = p pap=p 8. Universal bound laws: pvt=t (p v q) =~pA ng pA (p v q) = p 9. De Morgan's laws: (p Aq) =~p v ng 10. Absorption laws: pv (p Ag) p 11. Negations of t and e: e =t
1.(a). logic equiva (pag)v(: pag)v(pn: q)= pvq (b) Use Theorem 2.1.1 provided to you on exam paper to verify the given logical equivalence. Give a reason from the Theorem for each step in your proof. Theorem 2.1.1 Logical Equivalences Given any statement variables p, q, and r, a tautology t and a contradiction e, the following logical equivalences hold. p vq =q V p (p v q) vr = pv (q vr) p v (q ar) = (p vq) A (p vr) 1. Commutative laws: png =qAp 2. Associative laws: (pAq) Ar = p (a ar) 3. Distributive laws: pa (g vr) = (p ng) v (par) 4. Identity laws: 5. Negation laws: pat= p pVC= p pv ~p =t 6. Double negative law: (~p) = p 7. Idempotent laws: pvp = p pap=p 8. Universal bound laws: pvt=t (p v q) =~pA ng pA (p v q) = p 9. De Morgan's laws: (p Aq) =~p v ng 10. Absorption laws: pv (p Ag) p 11. Negations of t and e: e =t
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
This is for a discrete structures course.

Transcribed Image Text:1.(a). Use a truth table to verify the logical equivalence. below.
(p^g)v(: p^g)v(p^: q) = pvq
(b) Use Theorem 2.1.1 provided to you on exam paper to verify the given logical
equivalence. Give a reason from the Theorem for each step in your proof.
Theorem 2.1.1 Logical Equivalences
Given any statement variables p, q, and r, a tautology t and a contradiction c, the following logical equivalences
hold.
1. Commutative laws:
p vq mq v p
(p v q) Vr = pv (q vr)
p v (q Ar) = (p vq)A (p vr)
2. Associative laws:
(pAq) ar = pa (g ar)
3. Distributive laws:
PA (q vr) = (p A q) V (par)
4. Identity laws:
pat= p
pVCm p
5. Negation laws:
pv ~p at
PA~p = c
6. Double negative law:
(~p) p
7. Idempotent laws:
pv p= p
8. Universal bound laws:
pvt=t
pAce
(p v q) =~p A ng
pA (p v q) = p
9. De Morgan's laws:
(p Aq) =~p v ng
10. Absorption laws:
11. Negations of t and e:
pv (p Ag) = p
e =t
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images

Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.Recommended textbooks for you

Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated

Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY

Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated

Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY

Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,

