Biconditional elimination: Difference between revisions
en>Gregbard m clean up using AWB |
en>Mark viking Removing unreferenced tag |
||
Line 1: | Line 1: | ||
I'm | {{Transformation rules}} | ||
'''Biconditional elimination''' is the name of two [[validity|valid]] [[rule of inference|rules of inference]] of [[propositional calculus|propositional logic]]. It allows for one to [[inference|infer]] a [[Material conditional|conditional]] from a [[Logical biconditional|biconditional]]. If <math>(P \leftrightarrow Q)</math> is true, then one may infer that <math>(P \to Q)</math> is true, and also that <math>(Q \to P)</math> is true.<ref name=Cohen2007>{{cite web|last=Cohen|first=S. Marc|title=Chapter 8: The Logic of Conditionals|url=http://faculty.washington.edu/smcohen/120/Chapter8.pdf|publisher=University of Washington|accessdate=8 October 2013}}</ref> 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: | |||
:<math>\frac{(P \leftrightarrow Q)}{\therefore (P \to Q)}</math> | |||
and | |||
:<math>\frac{(P \leftrightarrow Q)}{\therefore (Q \to P)}</math> | |||
where the rule is that wherever an instance of "<math>(P \leftrightarrow Q)</math>" appears on a line of a proof, either "<math>(P \to Q)</math>" or "<math>(Q \to P)</math>" can be placed on a subsequent line; | |||
== Formal notation == | |||
The ''biconditional elimination'' rule may be written in [[sequent]] notation: | |||
:<math>(P \leftrightarrow Q) \vdash (P \to Q)</math> | |||
and | |||
:<math>(P \leftrightarrow Q) \vdash (Q \to P)</math> | |||
where <math>\vdash</math> is a [[metalogic]]al symbol meaning that <math>(P \to Q)</math>, in the first case, and <math>(Q \to P)</math> in the other are [[logical consequence|syntactic consequences]] of <math>(P \leftrightarrow Q)</math> in some [[formal system|logical system]]; | |||
or as the statement of a truth-functional [[Tautology (logic)|tautology]] or [[theorem]] of propositional logic: | |||
:<math>(P \leftrightarrow Q) \to (P \to Q)</math> | |||
:<math>(P \leftrightarrow Q) \to (Q \to P)</math> | |||
where <math>P</math>, and <math>Q</math> are propositions expressed in some formal system. | |||
==See also== | |||
* [[Logical biconditional]] | |||
==References== | |||
{{Reflist}} | |||
{{DEFAULTSORT:Biconditional Elimination}} | |||
[[Category:Rules of inference]] | |||
[[Category:Theorems in propositional logic]] |
Revision as of 04:52, 8 October 2013
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 is true, then one may infer that is true, and also that is true.[1] 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:
and
where the rule is that wherever an instance of "" appears on a line of a proof, either "" or "" can be placed on a subsequent line;
Formal notation
The biconditional elimination rule may be written in sequent notation:
and
where is a metalogical symbol meaning that , in the first case, and in the other are syntactic consequences of in some logical system;
or as the statement of a truth-functional tautology or theorem of propositional logic:
where , and are propositions expressed in some formal system.
See also
References
43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.