Biconditional elimination

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

Biconditional elimination is the name of two valid rules of inference of propositional logic. It allows for one to infer a conditional from a biconditional. If P \leftrightarrow Q is true, then one may infer that P \to Q is true, and also that Q \to P is true.

For example, if it's true that I'm breathing if and only if I'm alive, then it's true that if I'm breathing, I'm alive; likewise, it's true that if I'm alive, I'm breathing. The rules can be stated formally as: \frac{P \leftrightarrow Q}{\therefore P \to Q} and \frac{P \leftrightarrow Q}{\therefore Q \to P} where the rule is that wherever an instance of " P \leftrightarrow Q " appears on a line of a proof, either " P \to Q " or " Q \to P " can be placed on a subsequent line.

Biconditional elimination is the name of two valid rules of inference of propositional logic. It allows for one to infer a conditional from a biconditional. If P \leftrightarrow Q is true, then one may infer that P \to Q is true, and also that Q \to P is true.

For example, if it's true that I'm breathing if and only if I'm alive, then it's true that if I'm breathing, I'm alive; likewise, it's true that if I'm alive, I'm breathing. The rules can be stated formally as: \frac{P \leftrightarrow Q}{\therefore P \to Q} and \frac{P \leftrightarrow Q}{\therefore Q \to P} where the rule is that wherever an instance of " P \leftrightarrow Q " appears on a line of a proof, either " P \to Q " or " Q \to P " can be placed on a subsequent line.

(P \leftrightarrow Q) \vdash (P \to Q) and (P \leftrightarrow Q) \vdash (Q \to P) where \vdash is a metalogical symbol meaning that P \to Q , in the first case, and Q \to P in the other are syntactic consequences of P \leftrightarrow Q in some logical system; or as the statement of a truth-functional tautology or theorem of propositional logic: \begin{align} (P \leftrightarrow Q) &\to (P \to Q) \\ (P \leftrightarrow Q) &\to (Q \to P) \end{align} where P , and Q are propositions expressed in some formal system.

See also

Logical biconditional

Text derived from https://en.wikipedia.org/w/index.php?oldid=1377902635 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001377902635 · captured 1790883023.0 · version history

Cite this page as: encyclopegia.org, “Biconditional elimination”, snapshot enwiki-001377902635. https://encyclopegia.org/a/biconditional-elimination

Sources cited in this revision

1 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.