Statement-I: ~(A⇔∼B) is equivalent to A⇔B
Statement-2: A∨(~(A∧~B)) is a tautology.
STATEMENT- I is True, STATEMENT-2 is True; S TATEMENT-2 is a correct explanation for STATEMENT- I
STATEMENT-I is True, STATEMENT-2 is True; STATEMENT-2 is NOT a correct explanation for STATEMENT- I
STATEMENT-I is True, STATEMENT-2 is False
STATEMENT-I is False, STATEMENT-2 is True
We have
A∨[~(A∧~B)]≡A∨[~A∨B]≡(A∨~A)∨B≡T∨B≡T
Thus, Statement-2 is true.
≡~[A⇔~B]=∼[(A→∼B)∧(~B→A)]≡∼[(~A∨~B)∧(B∨A)]
≡∼[~(A∧B)∧(A∨B)]≡[(A∧B)∨(~A∧~B)]≡[(A∧B)∨(~A)]∧[(A∧B)∨(~B)]≡[(A∨~A)∨(B∨−A)]∧[(A∨~B)∧(B∨−B)]≡[T∧(~A∨B)]∧[(A∨~B)∧T]≡(A→B)∧(B→A)≡A⇔B