Category:Modus Ponendo Ponens
Jump to navigation
Jump to search
This category contains pages concerning Modus Ponendo Ponens:
Modus Ponendo Ponens is a valid argument in types of logic dealing with conditionals $\implies$.
This includes propositional logic and predicate logic, and in particular natural deduction.
Proof Rule
- If we can conclude $\phi \implies \psi$, and we can also conclude $\phi$, then we may infer $\psi$.
Sequent Form
\(\ds p\) | \(\implies\) | \(\ds q\) | ||||||||||||
\(\ds p\) | \(\) | \(\ds \) | ||||||||||||
\(\ds \vdash \ \ \) | \(\ds q\) | \(\) | \(\ds \) |
Pages in category "Modus Ponendo Ponens"
The following 18 pages are in this category, out of 18 total.
M
- Modus Ponendo Ponens
- Modus Ponendo Ponens/Also known as
- Modus Ponendo Ponens/Proof Rule
- Modus Ponendo Ponens/Proof Rule/Tableau Form
- Modus Ponendo Ponens/Sequent Form
- Modus Ponendo Ponens/Sequent Form/Proof 1
- Modus Ponendo Ponens/Sequent Form/Proof 2
- Modus Ponendo Ponens/Sequent Form/Proof by Truth Table
- Modus Ponendo Ponens/Variant 1
- Modus Ponendo Ponens/Variant 1/Proof 1
- Modus Ponendo Ponens/Variant 1/Proof by Truth Table
- Modus Ponendo Ponens/Variant 2
- Modus Ponendo Ponens/Variant 2/Proof 1
- Modus Ponendo Ponens/Variant 2/Proof 2
- Modus Ponendo Ponens/Variant 3
- Modus Ponendo Ponens/Variant 3/Proof 1
- Modus Ponendo Ponens/Variant 3/Proof by Truth Table
- Modus Ponens