SOLUTION: Solve using the methods of Reductio ad Absurdum 1. ~A∙~B ∴ A↔B

Algebra.Com
Question 1117149: Solve using the methods of Reductio ad Absurdum
1. ~A∙~B ∴ A↔B

Answer by solver91311(24713)   (Show Source): You can put this solution on YOUR website!


  Hint:  The negation of A <=> B is (A * ~B) V (~A * B) 


John

My calculator said it, I believe it, that settles it


RELATED QUESTIONS

Solve use reductio ad absurdum 1. ~P→(R∙S) 2.... (answered by math_helper)
How do I solve ~Q → (L → F), Q → ~A, F → B, L, therefore, ~A v B... (answered by jim_thompson5910)
Choose one of the proofs below and use one of the indirect proof techniques (reductio ad... (answered by jim_thompson5910)
I need help constructing an indirect proof using reductio ad absurdum for: ~S → (F... (answered by Edwin McCravy)
Solve the following using rules of replacement: (E → T) ∧ (T → O),... (answered by jim_thompson5910)
∼A∙~B ~D⊃A M⊃[(NvO)⊃P] Q⊃(SvT)... (answered by jim_thompson5910)
1. A→B 2. A→~(C∨B) ∴ ~A 1. (A&~B)&(~C∨D) 2.... (answered by Edwin McCravy)
1. (A∨~B)→(F∨(R∙G)) 2. A 3. F→L (answered by math_helper)
8. Write the expression using exponents. Do not solve. b ∙ b ∙ b ∙ b... (answered by Edwin McCravy,richard1234)