Biconditional introduction
   HOME

TheInfoList



OR:

In
propositional logic Propositional calculus is a branch of logic. It is also called propositional logic, statement logic, sentential calculus, sentential logic, or sometimes zeroth-order logic. It deals with propositions (which can be true or false) and relations b ...
, biconditional introductionCopi and Cohen is a valid rule of inference. It allows for one to infer a
biconditional In logic and mathematics, the logical biconditional, sometimes known as the material biconditional, is the logical connective (\leftrightarrow) used to conjoin two statements and to form the statement " if and only if ", where is known as t ...
from two conditional statements. The rule makes it possible to introduce a biconditional statement into a logical proof. If P \to Q is true, and if Q \to P is true, then one may infer that P \leftrightarrow Q is true. For example, from the statements "if I'm breathing, then I'm alive" and "if I'm alive, then I'm breathing", it can be inferred that "I'm breathing
if and only if In logic and related fields such as mathematics and philosophy, "if and only if" (shortened as "iff") is a biconditional logical connective between statements, where either both statements are true or both are false. The connective is b ...
I'm alive". Biconditional introduction is the
converse Converse may refer to: Mathematics and logic * Converse (logic), the result of reversing the two parts of a definite or implicational statement ** Converse implication, the converse of a material implication ** Converse nonimplication, a logical c ...
of
biconditional elimination 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 th ...
. The rule can be stated formally as: :\frac where the rule is that wherever instances of "P \to Q" and "Q \to P" appear on lines of a proof, "P \leftrightarrow Q" can validly be placed on a subsequent line.


Formal notation

The ''biconditional introduction'' rule may be written in
sequent In mathematical logic, a sequent is a very general kind of conditional assertion. : A_1,\,\dots,A_m \,\vdash\, B_1,\,\dots,B_n. A sequent may have any number ''m'' of condition formulas ''Ai'' (called " antecedents") and any number ''n'' of ass ...
notation: :(P \to Q), (Q \to P) \vdash (P \leftrightarrow Q) where \vdash is a
metalogic Metalogic is the study of the metatheory of logic. Whereas ''logic'' studies how logical systems can be used to construct valid and sound arguments, metalogic studies the properties of logical systems.Harry GenslerIntroduction to Logic Routledge, ...
al symbol meaning that P \leftrightarrow Q is a syntactic consequence when P \to Q and Q \to P are both in a proof; or as the statement of a truth-functional tautology or
theorem In mathematics, a theorem is a statement that has been proved, or can be proved. The ''proof'' of a theorem is a logical argument that uses the inference rules of a deductive system to establish that the theorem is a logical consequence of t ...
of propositional logic: :((P \to Q) \land (Q \to P)) \to (P \leftrightarrow Q) where P, and Q are propositions expressed in some
formal system A formal system is an abstract structure used for inferring theorems from axioms according to a set of rules. These rules, which are used for carrying out the inference of theorems from axioms, are the logical calculus of the formal system. A form ...
.


References

{{DEFAULTSORT:Biconditional Introduction Rules of inference Theorems in propositional logic