Biconditional Proof: Same as a conditional proof but it must be proven in two ways: A®B and B®A.
Conditional Introduction: This is the formal counterpart of a conditional proof.
Biconditional Elimination: You can conclude Q if you establish P and either P « Q or Q « P. BiconditionalIntroduction: To introduce P « Q, you must give two subproofs, one showing that Q follows from P, and one showing that P follows from Q. Prove: P ® Q « (~Q ® ~P) Notes
Feeds |
Contact