Abstract A form of Mathematical Argument that is guaranteed to be Valid Tools that enable Deductive Reasoning (演繹推理) Modus Ponens Case 1Premise 1p→qPremise 2pConclusionq Modus Tollens Denying the consequent, based on the idea of Contrapositive (逆否命题) Premise 1p→qPremise 2¬qConclusion¬p Generalisation Case 1Case 2PremisepqConclusionp∨qp∨q Specialisation Allow us to discard some information to focus on things that we are interested Case 1Case 2Premisep∧qp∧qConclusionpq Elimination Case 1Case 2Premise 1p∨qp∨qPremise 2¬q¬pConclusionpq Transitivity Case 1Premise 1p→qPremise 2q→rConclusionp→r Division into Cases The table below only shoes 2 cases, we can have more than 2 cases Case 1Premise 1p∨qPremise 2p→rPremise 3q→rConclusionr Contradiction Rule Premise 1¬p→falseConclusionp Important If a assumption leads to a contradiction, then that assumption must be false. The core of Proof by Contradiction (矛盾证明法)