Modus Ponens
What is Modus Ponens? Latin: mode that affirms
Modus Ponens, also known as Implication-Elimination, is an inference rule stating simply that given an implication and the presence of its premise, the consequent can be taken as true. In formal terms, Modus Ponens is generally written as:
a => B, a
B
Of course, the => symbol is the propositional calculus rule ‘implies’ with the corresponding truth table of:
| a | B | => |
| T | T | T |
| T | F | F |
| F | T | T |
| F | F | T |
An example of a modus ponens argument is: If Mike Fogus is comin’ up, then ya betta get this party started. Mike Fogus is comin’ up. Therefore, ya betta get this party started. <br/> -m
No Comments, Comment or Ping
Reply to “Modus Ponens”