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+[(\\tilde p+q)+(p+\\tilde q)]*\\tilde q \\\\\nP+(1+1)* \\tilde q\\\\\n\nP+1*\\tilde q\\\\\nP+\\tilde q\\\\\\\\\n2)( (p\\implies q))\\land (p \n \n\n\n\n\\leftrightarrow q)\\\\\n(\\tilde p \n\\bigvee q)\\bigwedge (\\tilde p\\tilde q+qp)\\\\\n\\tilde p\\tilde q+pq\\\\\n\\\\"
Comments
Leave a comment