Definition:Biconditional/Truth Function
Jump to navigation
Jump to search
Definition
The biconditional connective defines the truth function $f^\leftrightarrow$ as follows:
| \(\ds \map {f^\leftrightarrow} {\F, \F}\) | \(=\) | \(\ds \T\) | ||||||||||||
| \(\ds \map {f^\leftrightarrow} {\F, \T}\) | \(=\) | \(\ds \F\) | ||||||||||||
| \(\ds \map {f^\leftrightarrow} {\T, \F}\) | \(=\) | \(\ds \F\) | ||||||||||||
| \(\ds \map {f^\leftrightarrow} {\T, \T}\) | \(=\) | \(\ds \T\) |
Sources
- 1910: Alfred North Whitehead and Bertrand Russell: Principia Mathematica: Volume $\text { 1 }$ ... (previous) ... (next): Chapter $\text{I}$: Preliminary Explanations of Ideas and Notations