Category:Modus Ponendo Tollens
Jump to navigation
Jump to search
This category contains pages concerning Modus Ponendo Tollens:
Modus ponendo tollens is a valid argument in types of logic dealing with conjunctions $\land$ and negation $\neg$.
This includes propositional logic and predicate logic, and in particular natural deduction.
Proof Rule
- $(1): \quad$ If we can conclude $\map \neg {\phi \land \psi}$, and we can also conclude $\phi$, then we may infer $\neg \psi$.
- $(2): \quad$ If we can conclude $\map \neg {\phi \land \psi}$, and we can also conclude $\psi$, then we may infer $\neg \phi$.
Pages in category "Modus Ponendo Tollens"
The following 13 pages are in this category, out of 13 total.
M
- Modus Ponendo Tollens
- Modus Ponendo Tollens/Explanation
- Modus Ponendo Tollens/Proof Rule
- Modus Ponendo Tollens/Proof Rule/Tableau Form
- Modus Ponendo Tollens/Sequent Form
- Modus Ponendo Tollens/Sequent Form/Case 1
- Modus Ponendo Tollens/Sequent Form/Case 2
- Modus Ponendo Tollens/Variant
- Modus Ponendo Tollens/Variant/Formulation 1
- Modus Ponendo Tollens/Variant/Formulation 1/Forward Implication
- Modus Ponendo Tollens/Variant/Formulation 1/Proof
- Modus Ponendo Tollens/Variant/Formulation 1/Reverse Implication
- Modus Ponendo Tollens/Variant/Formulation 2