Construct the switching network of the given compound statements. Then, construct another switching network of the equivalent statement by applying the laws of logic:
1. p v (~p v q) v (p v ~q) ] ^ ~q
2. (p → q) ^ (p ↔ q)
P+[(p~+q)+(p+q~)]∗q~P+(1+1)∗q~P+1∗q~P+q~2)((p ⟹ q))∧(p↔q)(p~⋁q)⋀(p~q~+qp)p~q~+pqP+[(\tilde p+q)+(p+\tilde q)]*\tilde q \\ P+(1+1)* \tilde q\\ P+1*\tilde q\\ P+\tilde q\\\\ 2)( (p\implies q))\land (p \leftrightarrow q)\\ (\tilde p \bigvee q)\bigwedge (\tilde p\tilde q+qp)\\ \tilde p\tilde q+pq\\ \\P+[(p~+q)+(p+q~)]∗q~P+(1+1)∗q~P+1∗q~P+q~2)((p⟹q))∧(p↔q)(p~⋁q)⋀(p~q~+qp)p~q~+pq
Need a fast expert's response?
and get a quick answer at the best price
for any assignment or question with DETAILED EXPLANATIONS!
Comments