Biconditional elimination

From formulasearchengine
Revision as of 04:52, 8 October 2013 by en>Mark viking (Removing unreferenced tag)
Jump to navigation Jump to search

Template:Transformation rules

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 (PQ) is true, then one may infer that (PQ) is true, and also that (QP) 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:

(PQ)(PQ)

and

(PQ)(QP)

where the rule is that wherever an instance of "(PQ)" appears on a line of a proof, either "(PQ)" or "(QP)" can be placed on a subsequent line;

Formal notation

The biconditional elimination rule may be written in sequent notation:

(PQ)(PQ)

and

(PQ)(QP)

where is a metalogical symbol meaning that (PQ), in the first case, and (QP) in the other are syntactic consequences of (PQ) in some logical system;

or as the statement of a truth-functional tautology or theorem of propositional logic:

(PQ)(PQ)
(PQ)(QP)

where P, and Q 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.