0
$\begingroup$

I was working on proving that a statement ...

$ p \to \lnot(\lnot q \land (p \to q))$

... is a tautology using logical equivalences and wound up at this step:

$ T \lor F $

I'm unsure if the output would be true or not, or if its too ambiguous to get an answer from this. Thanks!

$\endgroup$
1
$\begingroup$

The $\lor$ is true iff at least one of the disjuncts is true. So, $T \lor F = T$

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.