571 views

2 Answers

0 votes
0 votes
A is logically equivalent to B if A→B and B→A both are tautology.

Rule- If A^B→C is valid, if we make C false then at least one of A and B, must be false.

Using this rule if you check, then you will find

(p → q) ∧ (q → r)→(p → r) is tautology.

(p → r)→(p → q) ∧ (q → r) is not tautology.

So not equivalent.
edited by
0 votes
0 votes
They are not logically equivalent to each other..Reason is:

(p → q) ∧ (q → r)→(p → r) is tautology.

but

(p → r)→(p → q) ∧ (q → r) is not tautology.
(p=0,q=1,r=0)

So not equivalent to each other

Related questions

0 votes
0 votes
2 answers
1
ykrishnay asked Feb 21, 2022
519 views
Show that p NAND q is logically equivalent to ¬(p ∧ q).how to prove this and i prove using truth table which is easy but how to prove using logical identities ?thank y...