Are you allowed to use truth tables?prove in propositional calculus the De morgan rule;
¬(p∧q)⟹¬q∨¬q
You may consider the above as challenging problem
Do not use the other De Morgan rule:
¬(p∧q)⟹¬p∨¬q
1st of all ,when i said the other De Morgan rule i meant the rule:Can you check the question, or post the source.
(When p is False, and q True, it evaluates to False).
No because true tables can only establish that the above is provable according to the central theorem of propositional calculus.Are you allowed to use truth tables?
But the statement you said you had to prove wasNow for the RHS:
Since p is false ¬p is true
And since q is true ¬q is false
Hence :¬p∨¬q is true
Therefor we have : LHS Is true and RHS TRUE as well
But true impling true is true
with q twice in the RHS. I presume you didn't mean that; did you not carefully proofread as you were asked??¬(p∧q)⟹¬q∨¬q
In order to help, we'll need to see what rules you are operating under. A Google search for "central theorem of propositional calculus" yields no source except a question on a site like this. And truth tables can be a valid form of proof, though it's perfectly reasonable for your teacher to require something else.No because true tables can only establish that the above is provable according to the central theorem of propositional calculus.
They do not provide the actual proof