Logical biconditional

This article relies largely or entirely on a single source. Relevant discussion may be found on the talk page. Please help improve this article by introducing citations to additional sources. Find sources: "Logical biconditional" – news · newspapers · books · scholar · JSTOR (June 2013)

Logical connectives
AND ${\displaystyle A\land B}$, ${\displaystyle A\cdot B}$, ${\displaystyle AB}$, ${\displaystyle A\&B}$, ${\displaystyle A\&\&B}$ equivalent ${\displaystyle A\equiv B}$, ${\displaystyle A\Leftrightarrow B}$, ${\displaystyle A\leftrightharpoons B}$ implies ${\displaystyle A\Rightarrow B}$, ${\displaystyle A\supset B}$, ${\displaystyle A\rightarrow B}$ NAND ${\displaystyle A{\overline {\land }}B}$, ${\displaystyle A\uparrow B}$, ${\displaystyle A\mid B}$, ${\displaystyle {\overline {A\cdot B}}}$ nonequivalent ${\displaystyle A\not \equiv B}$, ${\displaystyle A\not \Leftrightarrow B}$, ${\displaystyle A\nleftrightarrow B}$ NOR ${\displaystyle A{\overline {\lor }}B}$, ${\displaystyle A\downarrow B}$, ${\displaystyle {\overline {A+B}}}$ NOT ${\displaystyle \neg A}$, ${\displaystyle -A}$, ${\displaystyle {\overline {A}}}$, ${\displaystyle \sim A}$ OR ${\displaystyle A\lor B}$, ${\displaystyle A+B}$, ${\displaystyle A\mid B}$, ${\displaystyle A\parallel B}$ XNOR ${\displaystyle A\ {\text{XNOR}}\ B}$ XOR ${\displaystyle A{\underline {\lor }}B}$, ${\displaystyle A\oplus B}$ converse ${\displaystyle A\Leftarrow B}$, ${\displaystyle A\subset B}$, ${\displaystyle A\leftarrow B}$
Related concepts
Propositional calculus Predicate logic Boolean algebra Truth table Truth function Boolean function Functional completeness
Applications
Digital logic Programming languages Mathematical logic Philosophy of logic
Category
v t e

In logic and mathematics, the logical biconditional, also known as material biconditional or equivalence or biimplication or bientailment, is the logical connective used to conjoin two statements ${\displaystyle P}$ and ${\displaystyle Q}$ to form the statement "${\displaystyle P}$ if and only if ${\displaystyle Q}$" (often abbreviated as "${\displaystyle P}$ iff ${\displaystyle Q}$"^[1]), where ${\displaystyle P}$ is known as the antecedent, and ${\displaystyle Q}$ the consequent.^[2][3]

Nowadays, notations to represent equivalence include ${\displaystyle \leftrightarrow ,\Leftrightarrow ,\equiv }$.

${\displaystyle P\leftrightarrow Q}$ is logically equivalent to both ${\displaystyle (P\rightarrow Q)\land (Q\rightarrow P)}$ and ${\displaystyle (P\land Q)\lor (\neg P\land \neg Q)}$, and the XNOR (exclusive nor) Boolean operator, which means "both or neither".

Semantically, the only case where a logical biconditional is different from a material conditional is the case where the hypothesis (antecedent) is false but the conclusion (consequent) is true. In this case, the result is true for the conditional, but false for the biconditional.^[2]

In the conceptual interpretation, P = Q means "All P's are Q's and all Q's are P's". In other words, the sets P and Q coincide: they are identical. However, this does not mean that P and Q need to have the same meaning (e.g., P could be "equiangular trilateral" and Q could be "equilateral triangle"). When phrased as a sentence, the antecedent is the subject and the consequent is the predicate of a universal affirmative proposition (e.g., in the phrase "all men are mortal", "men" is the subject and "mortal" is the predicate).

In the propositional interpretation, ${\displaystyle P\leftrightarrow Q}$ means that P implies Q and Q implies P; in other words, the propositions are logically equivalent, in the sense that both are either jointly true or jointly false. Again, this does not mean that they need to have the same meaning, as P could be "the triangle ABC has two equal sides" and Q could be "the triangle ABC has two equal angles". In general, the antecedent is the premise, or the cause, and the consequent is the consequence. When an implication is translated by a hypothetical (or conditional) judgment, the antecedent is called the hypothesis (or the condition) and the consequent is called the thesis.

A common way of demonstrating a biconditional of the form ${\displaystyle P\leftrightarrow Q}$ is to demonstrate that ${\displaystyle P\rightarrow Q}$ and ${\displaystyle Q\rightarrow P}$ separately (due to its equivalence to the conjunction of the two converse conditionals^[2]). Yet another way of demonstrating the same biconditional is by demonstrating that ${\displaystyle P\rightarrow Q}$ and ${\displaystyle \neg P\rightarrow \neg Q}$.

When both members of the biconditional are propositions, it can be separated into two conditionals, of which one is called a theorem and the other its reciprocal.^{[citation needed]} Thus whenever a theorem and its reciprocal are true, we have a biconditional. A simple theorem gives rise to an implication, whose antecedent is the hypothesis and whose consequent is the thesis of the theorem.

It is often said that the hypothesis is the sufficient condition of the thesis, and that the thesis is the necessary condition of the hypothesis. That is, it is sufficient that the hypothesis be true for the thesis to be true, while it is necessary that the thesis be true if the hypothesis were true. When a theorem and its reciprocal are true, its hypothesis is said to be the necessary and sufficient condition of the thesis. That is, the hypothesis is both the cause and the consequence of the thesis at the same time.