HOME

TheInfoList



OR:

In
propositional logic The propositional calculus is a branch of logic. It is also called propositional logic, statement logic, sentential calculus, sentential logic, or sometimes zeroth-order logic. Sometimes, it is called ''first-order'' propositional logic to contra ...
, biconditional introductionCopi and Cohen is a valid
rule of inference Rules of inference are ways of deriving conclusions from premises. They are integral parts of formal logic, serving as norms of the Logical form, logical structure of Validity (logic), valid arguments. If an argument with true premises follows a ...
. It allows for one to
infer Inferences are steps in logical reasoning, moving from premises to logical consequences; etymologically, the word '' infer'' means to "carry forward". Inference is theoretically traditionally divided into deduction and induction, a distinctio ...
a
biconditional In logic and mathematics, the logical biconditional, also known as material biconditional or equivalence or bidirectional implication or biimplication or bientailment, is the logical connective used to conjoin two statements P and Q to form 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" (often shortened as "iff") is paraphrased by the biconditional, a logical connective between statements. The biconditional is true in two cases, where either bo ...
I'm alive". Biconditional introduction is the converse of biconditional elimination. 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 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. Logic concerns the truths that may be derived using a lo ...
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 and formal logic, a theorem is a statement (logic), statement that has been Mathematical proof, proven, or can be proven. The ''proof'' of a theorem is a logical argument that uses the inference rules of a deductive system to esta ...
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 and formalization of an axiomatic system used for deducing, using rules of inference, theorems from axioms. In 1921, David Hilbert proposed to use formal systems as the foundation of knowledge in ma ...
.


References

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