Definition:Biconditional

Definition
The biconditional is a binary connective:
 * $p \iff q$

defined as:
 * If $p$ is true, then $q$ is true, and if $q$ is true, then $p$ is true.

$p \iff q$ can be voiced:
 * $p$ if and only if $q$.

It can be formulated as:
 * $\left({p \implies q}\right) \land \left({q \implies p}\right)$

Boolean Interpretation
From the above, we see that the boolean interpretations for $\mathbf A \iff \mathbf B$ under the model $\mathcal M$ are:


 * $\left({\mathbf A \iff \mathbf B}\right)_{\mathcal M} = \begin{cases}

T & : \mathbf A_{\mathcal M} = \mathbf B_{\mathcal M} \\ F & : \text {otherwise} \end{cases}$

Complement
The complement of $\iff$ is the exclusive or operator.

Truth Function
The biconditional connective defines the truth function $f^\leftrightarrow$ as follows:

Also known as
Other names for this operator include:
 * Material Equivalence


 * Logical Equivalence


 * Logical Equality

Notational Variants
Various symbols are encountered that denote the concept of biconditionality:

It is usual in mathematics to use $\iff$, as there are other uses for the other symbols.

Also see

 * Therefore
 * Because
 * Interderivable (Logical Equivalence)
 * Conditional