Question: Theorem 2 . 1 . 1 Logical Equivalences Given any statement variables p , q , and r , a tautology t and a contradiction

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.
Commutative laws:
Assaciative lavs:
Distributive laws:
Identity laws:
Negation laws:
Double negative law;
Idempoient laws:
Universal bound laws:
De Morgan's laws:
Absorption laws:
Negations of t and c :
p??q=q??p
(p??q)??r=p??(q??r)
p??(qvvr)=(p??q)vv(p??r)
p??t=p
pvvp-=t
(p)=p
p??p=p
pvvt=t
(p??q)=pvvq
pvv(p??q)=p
t-=c
pvvq=qvvp
(pvvq)vvr=pvv(qvvr)
pvv(q??r)=(pvvq)??(pvvr)
pvvc=p
p??p-=c
pvvp=p
p??c=c
(pvvq)=p??q
=t
 Theorem 2.1.1 Logical Equivalences Given any statement variables p,q, and r,

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!