3 3 votes The negation of the statement $((A \wedge(B \vee C)) \Rightarrow(A \vee B)) \Rightarrow A$ isequivalent to $B \vee \sim C$equivalent to $\sim A$equivalent to $\sim C$a fallacy Mathematical Logic discrete-mathematics goclasses goclasses-cs-dpp goclasses-cs-dpp-day-226 goclasses-dm-practice-questions propositional-logic + – GO Classes 291 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
1 1 vote Answer: B Meticulous_March answered Mar 23 Meticulous_March comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes Case:1 A = TRUE => ¬ [((T ∧ (B ∨ C)) → (T ∨ B)) → T] = ¬ [((B ∨ C) → T) → T] = ¬(T → T) = ¬T = Falsea. B ∨ ¬Cb. ¬A = ¬T = Falsec. ¬C Case:2 A = FALSE => ¬ [((F ∧ (B ∨ C)) → (F ∨ B)) → F] = ¬ [(F → B) → F] = ¬(T → F) = ¬F = Truea. B ∨ ¬Cb. ¬A = ¬F = Truec. ¬C Answer: B chidambareswar23 answered Mar 23 chidambareswar23 comment Share Follow 0 reply Please log in or register to add a comment.