A biconditional is a sequence of sentences separated by occurrences of the ⇔ operator and enclosed in parentheses. For example, we can write the biconditional of p and q as (p ⇔ q).
A biconditional is true if and only if the truth values of its constituent sentences agree, i.e. they are either both true or both false.
p |
q |
(p ⇔ q) |
1 |
1 |
1 |
1 |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
1 |
|