Abstract
Modus Ponens
| Case 1 |
---|
Premise 1 | p→q |
Premise 2 | p |
Conclusion | q |
Modus Tollens
| |
---|
Premise 1 | p→q |
Premise 2 | ¬q |
Conclusion | ¬p |
Generalisation
| Case 1 | Case 2 |
---|
Premise | p | q |
Conclusion | p∨q | p∨q |
Specialisation
- Allow us to discard some information to focus on things that we are interested
| Case 1 | Case 2 |
---|
Premise | p∧q | p∧q |
Conclusion | p | q |
Elimination
| Case 1 | Case 2 |
---|
Premise 1 | p∨q | p∨q |
Premise 2 | ¬q | ¬p |
Conclusion | p | q |
Transitivity
| Case 1 |
---|
Premise 1 | p→q |
Premise 2 | q→r |
Conclusion | p→r |
Division into Cases
- The table below only shoes 2 cases, we can have more than 2 cases
| Case 1 |
---|
Premise 1 | p∨q |
Premise 2 | p→r |
Premise 3 | q→r |
Conclusion | r |
Contradiction Rule
| |
---|
Premise 1 | ¬p→false |
Conclusion | p |
If a assumption leads to a contradiction, then that assumption must be false. The core of Proof by Contradiction (矛盾证明法)