Prove, $(\mathrm{AVB}) \wedge[(\neg \mathrm{A}) \wedge(\neg \mathrm{B})]$ is a contradiction.

655views

Prove,

$(\mathrm{AVB}) \wedge[(\neg \mathrm{A}) \wedge(\neg \mathrm{B})]$ is a contradiction.

written 2.4 years ago by

prajapatijaimin • 3.3k

• modified 2.4 years ago

data structures and algorithms

ADD COMMENT EDIT

1 Answer

14views

written 2.4 years ago by

prajapatijaimin • 3.3k

Solution:

$\text { To Prove:- }(A \vee B) \wedge[(\neg A) \wedge(\neg B)] \text { is a contradiction. }\\$

$ \begin{array}{|c|c|c|c|c|c|c|} \hline A & B & A \vee B & \neg A & \neg B & (\neg A) \wedge(\neg B) & (A \vee B) \wedge[(\neg A) \wedge(\neg B)] \\\\ …

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.