Logical biconditional
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 [math]\displaystyle{ P }[/math] and [math]\displaystyle{ Q }[/math] to form the statement "[math]\displaystyle{ P }[/math] if and only if [math]\displaystyle{ Q }[/math]" (often abbreviated as "[math]\displaystyle{ P }[/math] iff [math]\displaystyle{ Q }[/math]"[1]), where [math]\displaystyle{ P }[/math] is known as the antecedent, and [math]\displaystyle{ Q }[/math] the consequent.[2][3]
Nowadays, notations to represent equivalence include [math]\displaystyle{ \leftrightarrow,\Leftrightarrow,\equiv }[/math].
[math]\displaystyle{ P\leftrightarrow Q }[/math] is logically equivalent to both [math]\displaystyle{ (P \rightarrow Q) \land (Q \rightarrow P) }[/math] and [math]\displaystyle{ (P \land Q) \lor (\neg P \land \neg Q) }[/math], 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, [math]\displaystyle{ P \leftrightarrow Q }[/math] 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 [math]\displaystyle{ P \leftrightarrow Q }[/math] is to demonstrate that [math]\displaystyle{ P \rightarrow Q }[/math] and [math]\displaystyle{ Q \rightarrow P }[/math] 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 [math]\displaystyle{ P \rightarrow Q }[/math] and [math]\displaystyle{ \neg P \rightarrow \neg Q }[/math].
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.
Notations
Notations to represent equivalence used in history include:
- [math]\displaystyle{ = }[/math] in George Boole in 1847.[4] Although Boole used [math]\displaystyle{ = }[/math] mainly on classes, he also considered the case that [math]\displaystyle{ x,y }[/math] are propositions in [math]\displaystyle{ x=y }[/math], and at the time [math]\displaystyle{ = }[/math] is equivalence.
- [math]\displaystyle{ \equiv }[/math] in Frege in 1879;[5]
- [math]\displaystyle{ \sim }[/math] in Bernays in 1918;[6]
- [math]\displaystyle{ \rightleftarrows }[/math] in Hilbert in 1927 (while he used [math]\displaystyle{ \sim }[/math] as the main symbol in the article);[7]
- [math]\displaystyle{ \leftrightarrow }[/math] in Hilbert and Ackermann in 1928[8] (they also introduced [math]\displaystyle{ \rightleftarrows,\sim }[/math] while they use [math]\displaystyle{ \sim }[/math] as the main symbol in the whole book; [math]\displaystyle{ \leftrightarrow }[/math] is adopted by many followers such as Becker in 1933[9]);
- [math]\displaystyle{ E }[/math] (prefix) in Łukasiewicz in 1929[10] and [math]\displaystyle{ Q }[/math] (prefix) in Łukasiewicz in 1951;[11]
- [math]\displaystyle{ \supset\subset }[/math] in Heyting in 1930;[12]
- [math]\displaystyle{ \Leftrightarrow }[/math] in Bourbaki in 1954;[13]
- [math]\displaystyle{ \subset\supset }[/math] in Chazal in 1996;[14]
and so on. Somebody else also use [math]\displaystyle{ \operatorname{EQ} }[/math] or [math]\displaystyle{ \operatorname{EQV} }[/math] occasionally.[citation needed][vague][clarification needed]
Definition
Logical equality (also known as biconditional) is an operation on two logical values, typically the values of two propositions, that produces a value of true if and only if both operands are false or both operands are true.[2]
Truth table
The following is a truth table for [math]\displaystyle{ P \leftrightarrow Q }[/math]:
| [math]\displaystyle{ P }[/math] | [math]\displaystyle{ Q }[/math] | [math]\displaystyle{ P \leftrightarrow Q }[/math] |
| True | True | True |
| True | False | False |
| False | True | False |
| False | False | True |
When more than two statements are involved, combining them with [math]\displaystyle{ \leftrightarrow }[/math] might be ambiguous. For example, the statement
- [math]\displaystyle{ x_1 \leftrightarrow x_2 \leftrightarrow x_3 \leftrightarrow \cdots \leftrightarrow x_n }[/math]
may be interpreted as
- [math]\displaystyle{ (((x_1 \leftrightarrow x_2) \leftrightarrow x_3) \leftrightarrow \cdots) \leftrightarrow x_n }[/math],
or may be interpreted as saying that all xi are jointly true or jointly false:
- [math]\displaystyle{ (x_1 \land \cdots \land x_n) \lor (\neg x_1 \land \cdots \land \neg x_n) }[/math]
As it turns out, these two statements are only the same when zero or two arguments are involved. In fact, the following truth tables only show the same bit pattern in the line with no argument and in the lines with two arguments:
meant as shorthand for
[math]\displaystyle{ (~x_1 \land \cdots \land x_n~) }[/math]
[math]\displaystyle{ \lor~(\neg x_1 \land \cdots \land \neg x_n) }[/math]
The Venn diagram directly below,
and line (ABC ) in this matrix
represent the same operation.
The left Venn diagram below, and the lines (AB ) in these matrices represent the same operation.
Venn diagrams
Red areas stand for true (as in 
for and).
|
|
|
Properties
Commutativity: Yes
| [math]\displaystyle{ A \leftrightarrow B }[/math] | [math]\displaystyle{ \Leftrightarrow }[/math] | [math]\displaystyle{ B \leftrightarrow A }[/math] |
|
|
[math]\displaystyle{ \Leftrightarrow }[/math] |
|
Associativity: Yes
| [math]\displaystyle{ ~A }[/math] | [math]\displaystyle{ ~~~\leftrightarrow~~~ }[/math] | [math]\displaystyle{ (B \leftrightarrow C) }[/math] | [math]\displaystyle{ \Leftrightarrow }[/math] | [math]\displaystyle{ (A \leftrightarrow B) }[/math] | [math]\displaystyle{ ~~~\leftrightarrow~~~ }[/math] | [math]\displaystyle{ ~C }[/math] | ||
|
[math]\displaystyle{ ~~~\leftrightarrow~~~ }[/math] | 
|
[math]\displaystyle{ \Leftrightarrow }[/math] | 
|
[math]\displaystyle{ \Leftrightarrow }[/math] | 
|
[math]\displaystyle{ ~~~\leftrightarrow~~~ }[/math] | 
|
Distributivity: Biconditional doesn't distribute over any binary function (not even itself), but logical disjunction distributes over biconditional.
Idempotency: No
| [math]\displaystyle{ ~A~ }[/math] | [math]\displaystyle{ ~\leftrightarrow~ }[/math] | [math]\displaystyle{ ~A~ }[/math] | [math]\displaystyle{ \Leftrightarrow }[/math] | [math]\displaystyle{ ~1~ }[/math] | [math]\displaystyle{ \nLeftrightarrow }[/math] | [math]\displaystyle{ ~A~ }[/math] |
|
[math]\displaystyle{ ~\leftrightarrow~ }[/math] |
|
[math]\displaystyle{ \Leftrightarrow }[/math] | 
|
[math]\displaystyle{ \nLeftrightarrow }[/math] |
|
Monotonicity: No
| [math]\displaystyle{ A \rightarrow B }[/math] | [math]\displaystyle{ \nRightarrow }[/math] | [math]\displaystyle{ (A \leftrightarrow C) }[/math] | [math]\displaystyle{ \rightarrow }[/math] | [math]\displaystyle{ (B \leftrightarrow C) }[/math] | ||
|
[math]\displaystyle{ \nRightarrow }[/math] | 
|
[math]\displaystyle{ \Leftrightarrow }[/math] | 
|
[math]\displaystyle{ \rightarrow }[/math] |
|
Truth-preserving: Yes
When all inputs are true, the output is true.
| [math]\displaystyle{ A \land B }[/math] | [math]\displaystyle{ \Rightarrow }[/math] | [math]\displaystyle{ A \leftrightarrow B }[/math] |
|
|
[math]\displaystyle{ \Rightarrow }[/math] |
|
Falsehood-preserving: No
When all inputs are false, the output is not false.
| [math]\displaystyle{ A \leftrightarrow B }[/math] | [math]\displaystyle{ \nRightarrow }[/math] | [math]\displaystyle{ A \lor B }[/math] |
|
|
[math]\displaystyle{ \nRightarrow }[/math] | 
|
Walsh spectrum: (2,0,0,2)
Nonlinearity: 0 (the function is linear)
Rules of inference
Like all connectives in first-order logic, the biconditional has rules of inference that govern its use in formal proofs.
Biconditional introduction
Biconditional introduction allows one to infer that if B follows from A and A follows from B, then A if and only if B.
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 I'm alive" or equivalently, "I'm alive if and only if I'm breathing." Or more schematically:
B → A A → B ∴ A ↔ B
B → A A → B ∴ B ↔ A
Biconditional elimination
Biconditional elimination allows one to infer a conditional from a biconditional: if A ↔ B is true, then one may infer either A → B, or B → A.
For example, if it is true that I'm breathing if and only if I'm alive, then it's true that if I'm breathing, then I'm alive; likewise, it's true that if I'm alive, then I'm breathing. Or more schematically:
A ↔ B ∴ A → B
A ↔ B ∴ B → A
Colloquial usage
One unambiguous way of stating a biconditional in plain English is to adopt the form "b if a and a if b"—if the standard form "a if and only if b" is not used. Slightly more formally, one could also say that "b implies a and a implies b", or "a is necessary and sufficient for b". The plain English "if'" may sometimes be used as a biconditional (especially in the context of a mathematical definition[15]). In which case, one must take into consideration the surrounding context when interpreting these words.
For example, the statement "I'll buy you a new wallet if you need one" may be interpreted as a biconditional, since the speaker doesn't intend a valid outcome to be buying the wallet whether or not the wallet is needed (as in a conditional). However, "it is cloudy if it is raining" is generally not meant as a biconditional, since it can still be cloudy even if it is not raining.
See also
- If and only if
- Logical equivalence
- Logical equality
- XNOR gate
- Biconditional elimination
- Biconditional introduction
References
- ↑ Weisstein, Eric W.. "Iff" (in en). http://mathworld.wolfram.com/Iff.html.
- ↑ 2.0 2.1 2.2 2.3 Peil, Timothy. "Conditionals and Biconditionals". http://web.mnstate.edu/peil/geometry/Logic/4logic.htm.
- ↑ Brennan, Joseph G. (1961). Handbook of Logic (2nd ed.). Harper & Row. pp. 81.
- ↑ Boole, G. (1847). The Mathematical Analysis of Logic, Being an Essay Towards a Calculus of Deductive Reasoning. Cambridge/London: Macmillan, Barclay, & Macmillan/George Bell. p. 17. https://archive.org/details/mathematicalanal00booluoft.
- ↑ Frege, G. (1879) (in German). Begriffsschrift, eine der arithmetischen nachgebildete Formelsprache des reinen Denkens. Halle a/S.: Verlag von Louis Nebert. p. 15.
- ↑ Bernays, P. (1918). Beiträge zur axiomatischen Behandlung des Logik-Kalküls. Göttingen: Universität Göttingen. p. 3.
- ↑ Hilbert, D. (1928). "Die Grundlagen der Mathematik" (in German). Abhandlungen aus dem mathematischen Seminar der Hamburgischen Universität 6: 65–85. doi:10.1007/BF02940602.
- ↑ Hilbert, D.; Ackermann, W. (1928) (in German). Grundzügen der theoretischen Logik (1 ed.). Berlin: Verlag von Julius Springer. p. 4.
- ↑ Becker, A. (1933) (in German). Die Aristotelische Theorie der Möglichkeitsschlösse: Eine logisch-philologische Untersuchung der Kapitel 13-22 von Aristoteles' Analytica priora I. Berlin: Junker und Dünnhaupt Verlag. p. 4.
- ↑ Łukasiewicz, J. (1958). Słupecki, J.. ed (in Polish). Elementy logiki matematycznej (2 ed.). Warszawa: Państwowe Wydawnictwo Naukowe.
- ↑ Łukasiewicz, J. (1957). Słupecki, J.. ed (in Polish). Aristotle's Syllogistic from the Standpoint of Modern Formal Logic (2 ed.). Glasgow, New York, Toronto, Melbourne, Wellington, Bombay, Calcutta, Madras, Karachi, Lahore, Dacca, Cape Town, Salisbury, Nairobi, Ibadan, Accra, Kuala Lumpur and Hong Kong: Oxford University Press.
- ↑ Heyting, A. (1930). "Die formalen Regeln der intuitionistischen Logik" (in German). Sitzungsberichte der Preussischen Akademie der Wissenschaften, Physikalisch-mathematische Klasse: 42–56.
- ↑ Bourbaki, N. (1954) (in French). Théorie des ensembles. Paris: Hermann & Cie, Éditeurs. p. 32.
- ↑ Chazal, G. (1996). Eléments de logique formelle. Paris: Hermes Science Publications.
- ↑ In fact, such is the style adopted by Wikipedia's manual of style in mathematics.
External links
 | ||
| ||
| ||
| ||
| ||
 |  |
