BREAKING NEWS
If and only if

## Summary

↔⇔≡⟺
Logical symbols representing iff

In logic and related fields such as mathematics and philosophy, "if and only if" (often shortened as "iff") is paraphrased by the biconditional, a logical connective[1] between statements. The biconditional is true in two cases, where either both statements are true or both are false. The connective is biconditional (a statement of material equivalence),[2] and can be likened to the standard material conditional ("only if", equal to "if ... then") combined with its reverse ("if"); hence the name. The result is that the truth of either one of the connected statements requires the truth of the other (i.e. either both statements are true, or both are false), though it is controversial whether the connective thus defined is properly rendered by the English "if and only if"—with its pre-existing meaning. For example, P if and only if Q means that P is true whenever Q is true, and the only case in which P is true is if Q is also true, whereas in the case of P if Q, there could be other scenarios where P is true and Q is false.

In writing, phrases commonly used as alternatives to P "if and only if" Q include: Q is necessary and sufficient for P, for P it is necessary and sufficient that Q, P is equivalent (or materially equivalent) to Q (compare with material implication), P precisely if Q, P precisely (or exactly) when Q, P exactly in case Q, and P just in case Q.[3] Some authors regard "iff" as unsuitable in formal writing;[4] others consider it a "borderline case" and tolerate its use.[5] In logical formulae, logical symbols, such as ${\displaystyle \leftrightarrow }$ and ${\displaystyle \Leftrightarrow }$,[6] are used instead of these phrases; see § Notation below.

## Definition

${\displaystyle \neg P\land \neg Q}$

${\displaystyle P\land Q}$

${\displaystyle P\rightarrow Q}$

${\displaystyle P\leftarrow Q}$

${\displaystyle P\leftrightarrow Q}$

The truth table of P ${\displaystyle \leftrightarrow }$  Q is as follows:[7][8]

${\displaystyle P}$ ${\displaystyle Q}$ ${\displaystyle \neg P\land \neg Q}$ ${\displaystyle P\land Q}$ ${\displaystyle P\rightarrow Q}$ ${\displaystyle P\leftarrow Q}$ ${\displaystyle P\leftrightarrow Q}$
FFTFTTT
FTFFTFF
TFFFFTF
TTFTTTT

It is equivalent to that produced by the XNOR gate, and opposite to that produced by the XOR gate.[9]

## Usage

### Notation

The corresponding logical symbols are "${\displaystyle \leftrightarrow }$ ", "${\displaystyle \Leftrightarrow }$ ",[6] and ${\displaystyle \equiv }$ ,[10] and sometimes "iff". These are usually treated as equivalent. However, some texts of mathematical logic (particularly those on first-order logic, rather than propositional logic) make a distinction between these, in which the first, ↔, is used as a symbol in logic formulas, while ⇔ is used in reasoning about those logic formulas (e.g., in metalogic). In Łukasiewicz's Polish notation, it is the prefix symbol ${\displaystyle E}$ .[11]

Another term for the logical connective, i.e., the symbol in logic formulas, is exclusive nor.

In TeX, "if and only if" is shown as a long double arrow: ${\displaystyle \iff }$  via command \iff or \Longleftrightarrow.[12]

### Proofs

In most logical systems, one proves a statement of the form "P iff Q" by proving either "if P, then Q" and "if Q, then P", or "if P, then Q" and "if not-P, then not-Q". Proving these pairs of statements sometimes leads to a more natural proof, since there are not obvious conditions in which one would infer a biconditional directly. An alternative is to prove the disjunction "(P and Q) or (not-P and not-Q)", which itself can be inferred directly from either of its disjuncts—that is, because "iff" is truth-functional, "P iff Q" follows if P and Q have been shown to be both true, or both false.

### Origin of iff and pronunciation

Usage of the abbreviation "iff" first appeared in print in John L. Kelley's 1955 book General Topology.[13] Its invention is often credited to Paul Halmos, who wrote "I invented 'iff,' for 'if and only if'—but I could never believe I was really its first inventor."[14]

It is somewhat unclear how "iff" was meant to be pronounced. In current practice, the single 'word' "iff" is almost always read as the four words "if and only if". However, in the preface of General Topology, Kelley suggests that it should be read differently: "In some cases where mathematical content requires 'if and only if' and euphony demands something less I use Halmos' 'iff'". The authors of one discrete mathematics textbook suggest:[15] "Should you need to pronounce iff, really hang on to the 'ff' so that people hear the difference from 'if'", implying that "iff" could be pronounced as [ɪfː].

### Usage in definitions

Conventionally, definitions are "if and only if" statements; some texts — such as Kelley's General Topology — follow this convention, and use "if and only if" or iff in definitions of new terms.[16] However, this usage of "if and only if" is relatively uncommon and overlooks the linguistic fact that the "if" of a definition is interpreted as meaning "if and only if". The majority of textbooks, research papers and articles (including English Wikipedia articles) follow the linguistic convention of interpreting "if" as "if and only if" whenever a mathematical definition is involved (as in "a topological space is compact if every open cover has a finite subcover").[17] Moreover, in the case of a recursive definition, the only if half of the definition is interpreted as a sentence in the metalanguage stating that the sentences in the definition of a predicate are the only sentences determining the extension of the predicate.

## In terms of Euler diagrams

Euler diagrams show logical relationships among events, properties, and so forth. "P only if Q", "if P then Q", and "P→Q" all mean that P is a subset, either proper or improper, of Q. "P if Q", "if Q then P", and Q→P all mean that Q is a proper or improper subset of P. "P if and only if Q" and "Q if and only if P" both mean that the sets P and Q are identical to each other.

## More general usage

Iff is used outside the field of logic as well. Wherever logic is applied, especially in mathematical discussions, it has the same meaning as above: it is an abbreviation for if and only if, indicating that one statement is both necessary and sufficient for the other. This is an example of mathematical jargon (although, as noted above, if is more often used than iff in statements of definition).

The elements of X are all and only the elements of Y means: "For any z in the domain of discourse, z is in X if and only if z is in Y."

## When "if" means "if and only if"

In their Artificial Intelligence: A Modern Approach, Russell and Norvig note (page 282),[18] in effect, that it is often more natural to express if and only if as if together with a "database (or logic programming) semantics". They give the example of the English sentence "Richard has two brothers, Geoffrey and John".

In a database or logic program, this could be represented simply by two sentences:

Brother(Richard, Geoffrey).
Brother(Richard, John).

The database semantics interprets the database (or program) as containing all and only the knowledge relevant for problem solving in a given domain. It interprets only if as expressing in the metalanguage that the sentences in the database represent the only knowledge that should be considered when drawing conclusions from the database.

In first-order logic (FOL) with the standard semantics, the same English sentence would need to be represented, using if and only if, with only if interpreted in the object language, in some such form as:

${\displaystyle \forall }$  X(Brother(Richard, X) iff X = Geoffrey or X = John).
Geoffrey ≠ John.

Compared with the standard semantics for FOL, the database semantics has a more efficient implementation. Instead of reasoning with sentences of the form:

conclusion iff conditions

it uses sentences of the form:

conclusion if conditions

to reason forwards from conditions to conclusions or backwards from conclusions to conditions.

The database semantics is analogous to the legal principle expressio unius est exclusio alterius (the express mention of one thing excludes all others). Moreover, it underpins the application of logic programming to the representation of legal texts and legal reasoning.[19]

## References

1. ^ "Logical Connectives". sites.millersville.edu. Retrieved 10 September 2023.
2. ^ Copi, I. M.; Cohen, C.; Flage, D. E. (2006). Essentials of Logic (Second ed.). Upper Saddle River, NJ: Pearson Education. p. 197. ISBN 978-0-13-238034-8.
3. ^ Weisstein, Eric W. "Iff." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/Iff.html Archived 13 November 2018 at the Wayback Machine
4. ^ E.g. Daepp, Ulrich; Gorkin, Pamela (2011), Reading, Writing, and Proving: A Closer Look at Mathematics, Undergraduate Texts in Mathematics, Springer, p. 52, ISBN 9781441994790, While it can be a real time-saver, we don't recommend it in formal writing.
5. ^ Rothwell, Edward J.; Cloud, Michael J. (2014), Engineering Writing by Design: Creating Formal Documents of Lasting Value, CRC Press, p. 98, ISBN 9781482234312, It is common in mathematical writing
6. ^ a b Peil, Timothy. "Conditionals and Biconditionals". web.mnstate.edu. Archived from the original on 24 October 2020. Retrieved 4 September 2020.
7. ^ p <=> q Archived 18 October 2016 at the Wayback Machine. Wolfram|Alpha
8. ^ If and only if, UHM Department of Mathematics, archived from the original on 5 May 2000, retrieved 16 October 2016, Theorems which have the form "P if and only Q" are much prized in mathematics. They give what are called "necessary and sufficient" conditions, and give completely equivalent and hopefully interesting new ways to say exactly the same thing.
9. ^ "XOR/XNOR/Odd Parity/Even Parity Gate". www.cburch.com. Archived from the original on 7 April 2022. Retrieved 22 October 2019.
10. ^ Weisstein, Eric W. "Equivalent". mathworld.wolfram.com. Archived from the original on 3 October 2020. Retrieved 4 September 2020.
11. ^ "Jan Łukasiewicz > Łukasiewicz's Parenthesis-Free or Polish Notation (Stanford Encyclopedia of Philosophy)". plato.stanford.edu. Archived from the original on 9 August 2019. Retrieved 22 October 2019.
12. ^ "LaTeX:Symbol". Art of Problem Solving. Archived from the original on 22 October 2019. Retrieved 22 October 2019.
13. ^ General Topology, reissue ISBN 978-0-387-90125-1
14. ^ Nicholas J. Higham (1998). Handbook of writing for the mathematical sciences (2nd ed.). SIAM. p. 24. ISBN 978-0-89871-420-3.
15. ^ Maurer, Stephen B.; Ralston, Anthony (2005). Discrete Algorithmic Mathematics (3rd ed.). Boca Raton, Fla.: CRC Press. p. 60. ISBN 1568811667.
16. ^ For instance, from General Topology, p. 25: "A set is countable iff it is finite or countably infinite." [boldface in original]
17. ^ Krantz, Steven G. (1996), A Primer of Mathematical Writing, American Mathematical Society, p. 71, ISBN 978-0-8218-0635-7
18. ^ Russell, Stuart J.; Norvig, Peter (2020) [1995]. Artificial Intelligence: A Modern Approach (4 ed.). Prentice Hall. p. 1136. ISBN 978-0-13-461099-3. OCLC 359890490.
19. ^ Kowalski, R., Dávila, J., Sartor, G. and Calejo, M., 2023. Logical English for law and education. http://www.doc.ic.ac.uk/~rak/papers/Logical%20English%20for%20Law%20and%20Education%20.pdf In Prolog: The Next 50 Years (pp. 287-299). Cham: Springer Nature Switzerland.