| << Chapter < Page | Chapter >> Page > |
| Abbreviation | Name | If you know all of | then you can infer |
|---|---|---|---|
| Intro | and-introduction | ||
| Elim | and-elimination (left) | ||
| and-elimination (right) | |||
| Intro | or-introduction (left) | ||
| or-introduction (right) | |||
| Elim | or-elimination | ||
| Intro | if-introduction | ||
| Elim | if-elimination (modus ponens) | ||
| Intro | false-introduction | ||
| Elim | false-elimination | ||
| RAA | reductio ad absurdum (v. 1) | ||
| reductio ad absurdum (v. 2) | |||
| Intro | negation-introduction | ||
| Elim | negation-elimination | ||
| CaseElim | case-elimination (left) | ||
| case-elimination (right) | |||
As usual, , , , are meta-variables standing for any WFF.
This is by no means the only possible inference system for propositional logic.
Notification Switch
Would you like to follow the 'Intro to logic' conversation and receive update notifications?
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|