Let us create a truth table for all of the following formulas and find if the following are logically equivalent.
1. f(p,q)=(∼p∨q)∧(∼q)↔∼(p∨q)
p0011q0101∼q1010∼p1100∼p∨q1101∼(p∨q)1000(∼p∨q)∧(∼q)1000f(p,q)1111
Since the formula f(p,q) is tautology, we conclude that the formulas (∼p∨q)∧(∼q) and ∼(p∨q) are logically equivalent.
2. f(p,q)=(p∧∼q)∨(∼p∨q)↔T
p0011q0101∼q1010∼p1100p∧∼q0010∼p∨q1101(p∧∼q)∨(∼p∨q)1111f(p,q)1111
Since the formula f(p,q) is tautology, we conclude that the formulas (p∧∼q)∨(∼p∨q) and T are logically equivalent.
Comments
Leave a comment