Category:Biconditional Elimination
Jump to navigation
Jump to search
This category contains pages concerning Biconditional Elimination:
The rule of biconditional elimination is a valid argument in types of logic dealing with conditionals $\implies$ and biconditionals $\iff$.
This includes classical propositional logic and predicate logic, and in particular natural deduction.
Proof Rule
- $(1): \quad$ If we can conclude $\phi \iff \psi$, then we may infer $\phi \implies \psi$.
- $(2): \quad$ If we can conclude $\phi \iff \psi$, then we may infer $\psi \implies \phi$.
Sequent Form
\(\text {(1)}: \quad\) | \(\ds p \iff q\) | \(\vdash\) | \(\ds p \implies q\) | |||||||||||
\(\text {(2)}: \quad\) | \(\ds p \iff q\) | \(\vdash\) | \(\ds q \implies p\) |
Pages in category "Biconditional Elimination"
The following 9 pages are in this category, out of 9 total.
B
- Biconditional Elimination
- Biconditional Elimination/Also known as
- Biconditional Elimination/Proof Rule
- Biconditional Elimination/Proof Rule/Tableau Form
- Biconditional Elimination/Sequent Form
- Biconditional Elimination/Sequent Form/Proof 1
- Biconditional Elimination/Sequent Form/Proof 1/Form 1
- Biconditional Elimination/Sequent Form/Proof 1/Form 2
- Biconditional Elimination/Sequent Form/Proof by Truth Table