HOME

TheInfoList



OR:

In
logic Logic is the study of correct reasoning. It includes both formal and informal logic. Formal logic is the science of deductively valid inferences or of logical truths. It is a formal science investigating how conclusions follow from premis ...
and related fields such as mathematics and philosophy, "if and only if" (shortened as "iff") is a biconditional
logical connective In logic, a logical connective (also called a logical operator, sentential connective, or sentential operator) is a logical constant. They can be used to connect logical formulas. For instance in the syntax of propositional logic, the binary ...
between statements, where either both statements are true or both are false. The connective is biconditional (a statement of material equivalence), and can be likened to the standard
material conditional The material conditional (also known as material implication) is an operation commonly used in logic. When the conditional symbol \rightarrow is interpreted as material implication, a formula P \rightarrow Q is true unless P is true and Q i ...
("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''. Some authors regard "iff" as unsuitable in formal writing; others consider it a "borderline case" and tolerate its use. In logical formulae, logical symbols, such as \leftrightarrow and \Leftrightarrow, are used instead of these phrases; see below.


Definition

The
truth table A truth table is a mathematical table used in logic—specifically in connection with Boolean algebra (logic), Boolean algebra, boolean functions, and propositional calculus—which sets out the functional values of logical expression (mathematics) ...
of ''P'' \Leftrightarrow ''Q'' is as follows: It is equivalent to that produced by the XNOR gate, and opposite to that produced by the XOR gate.


Usage


Notation

The corresponding logical symbols are "↔", "\Leftrightarrow", and " ", and sometimes "iff". These are usually treated as equivalent. However, some texts of
mathematical logic Mathematical logic is the study of formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory. Research in mathematical logic commonly addresses the mathematical properties of formal ...
(particularly those on
first-order logic First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quanti ...
, rather than
propositional logic Propositional calculus is a branch of logic. It is also called propositional logic, statement logic, sentential calculus, sentential logic, or sometimes zeroth-order logic. It deals with propositions (which can be true or false) and relations ...
) 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 Łukasiewicz is a Polish surname. It comes from the given name Łukasz (Lucas). It is found across Poland, particularly in central regions. It is related to the surnames Łukaszewicz and Lukashevich. People * Antoni Łukasiewicz (born 1983), ...
's
Polish notation Polish notation (PN), also known as normal Polish notation (NPN), Łukasiewicz notation, Warsaw notation, Polish prefix notation or simply prefix notation, is a mathematical notation in which operators ''precede'' their operands, in contrast ...
, it is the prefix symbol 'E'. Another term for the
logical connective In logic, a logical connective (also called a logical operator, sentential connective, or sentential operator) is a logical constant. They can be used to connect logical formulas. For instance in the syntax of propositional logic, the binary ...
, i.e., the symbol in logic formulas, is
exclusive nor Logical equality is a logical operator that corresponds to equality in Boolean algebra and to the logical biconditional in propositional calculus. It gives the functional value '' true'' if both functional arguments have the same logical v ...
. In TeX, "if and only if" is shown as a long double arrow: \iff via command \iff.


Proofs

In most
logical system A formal system is an abstract structure used for inferring theorems from axioms according to a set of rules. These rules, which are used for carrying out the inference of theorems from axioms, are the logical calculus of the formal system. A for ...
s, 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 pair 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 In logic, disjunction is a logical connective typically notated as \lor and read aloud as "or". For instance, the English language sentence "it is raining or it is snowing" can be represented in logic using the disjunctive formula R \lor ...
"(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-function In logic, a truth function is a function that accepts truth values as input and produces a unique truth value as output. In other words: The input and output of a truth function are all truth values; a truth function will always output exactly o ...
al, "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 John L. Kelley (December 6, 1916, Kansas – November 26, 1999, Berkeley, California) was an American mathematician at the University of California, Berkeley, who worked in general topology and functional analysis. Kelley's 1955 text, ''General ...
's 1955 book ''General Topology''. Its invention is often credited to
Paul Halmos Paul Richard Halmos ( hu, Halmos Pál; March 3, 1916 – October 2, 2006) was a Hungarian-born American mathematician and statistician who made fundamental advances in the areas of mathematical logic, probability theory, statistics, operat ...
, who wrote "I invented 'iff,' for 'if and only if'—but I could never believe I was really its first inventor." 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 Phonaesthetics (also spelled phonesthetics in North America) is the study of beauty and pleasantness associated with the sounds of certain words or parts of words. The term was first used in this sense, perhaps by during the mid-20th century an ...
demands something less I use Halmos' 'iff'". The authors of one discrete mathematics textbook suggest: "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 .


Usage in definitions

Technically, definitions are "if and only if" statements; some texts — such as Kelley's ''General Topology'' — follow the strict demands of logic, and use "if and only if" or ''iff'' in definitions of new terms. However, this logically correct usage of "if and only if" 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 to interpret "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").


Distinction from "if" and "only if"

* ''"Madison will eat the fruit if it is an apple."'' (equivalent to ''"Only if Madison will eat the fruit, can it be an apple"'' or ''"Madison will eat the fruit ''←'' the fruit is an apple"'') *: This states that Madison will eat fruits that are apples. It does not, however, exclude the possibility that Madison might also eat bananas or other types of fruit. All that is known for certain is that she will eat any and all apples that she happens upon. That the fruit is an apple is a ''sufficient'' condition for Madison to eat the fruit. * ''"Madison will eat the fruit only if it is an apple."'' (equivalent to ''"If Madison will eat the fruit, then it is an apple"'' or ''"Madison will eat the fruit ''→'' the fruit is an apple"'') *: This states that the only fruit Madison will eat is an apple. It does not, however, exclude the possibility that Madison will refuse an apple if it is made available, in contrast with (1), which requires Madison to eat any available apple. In this case, that a given fruit is an apple is a ''necessary'' condition for Madison to be eating it. It is not a sufficient condition since Madison might not eat all the apples she is given. * ''"Madison will eat the fruit if and only if it is an apple."'' (equivalent to ''"Madison will eat the fruit ''↔'' the fruit is an apple"'') *: This statement makes it clear that Madison will eat all and only those fruits that are apples. She will not leave any apple uneaten, and she will not eat any other type of fruit. That a given fruit is an apple is both a ''necessary'' and a ''sufficient'' condition for Madison to eat the fruit. Sufficiency is the converse of necessity. That is to say, given ''P''→''Q'' (i.e. if ''P'' then ''Q''), ''P'' would be a sufficient condition for ''Q'', and ''Q'' would be a necessary condition for ''P''. Also, given ''P''→''Q'', it is true that ''¬Q''→''¬P'' (where ¬ is the negation operator, i.e. "not"). This means that the relationship between ''P'' and ''Q'', established by ''P''→''Q'', can be expressed in the following, all equivalent, ways: :''P'' is sufficient for ''Q'' :''Q'' is necessary for ''P'' :''¬Q'' is sufficient for ''¬P'' :''¬P'' is necessary for ''¬Q'' As an example, take the first example above, which states ''P''→''Q'', where ''P'' is "the fruit in question is an apple" and ''Q'' is "Madison will eat the fruit in question". The following are four equivalent ways of expressing this very relationship: :If the fruit in question is an apple, then Madison will eat it. :Only if Madison will eat the fruit in question, is it an apple. :If Madison will not eat the fruit in question, then it is not an apple. :Only if the fruit in question is not an apple, will Madison not eat it. Here, the second example can be restated in the form of ''if...then'' as "If Madison will eat the fruit in question, then it is an apple"; taking this in conjunction with the first example, we find that the third example can be stated as "If the fruit in question is an apple, then Madison will eat it; ''and'' if Madison will eat the fruit, then it is an apple".


In terms of Euler diagrams

File:Example of A is a proper subset of B.svg, ''A'' is a proper subset of ''B''. A number is in ''A'' only if it is in ''B''; a number is in ''B'' if it is in ''A''. File:Example of C is no proper subset of B.svg, ''C'' is a subset but not a proper subset of ''B''. A number is in ''B'' if and only if it is in ''C'', and a number is in ''C'' if and only if it is in ''B''.
Euler diagram An Euler diagram (, ) is a diagrammatic means of representing sets and their relationships. They are particularly useful for explaining complex hierarchies and overlapping definitions. They are similar to another set diagramming technique, Ve ...
s 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 In mathematics, set ''A'' is a subset of a set ''B'' if all elements of ''A'' are also elements of ''B''; ''B'' is then a superset of ''A''. It is possible for ''A'' and ''B'' to be equal; if they are unequal, then ''A'' is a proper subset o ...
, 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 Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ...
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 The language of mathematics has a vast vocabulary of specialist and technical terms. It also has a certain amount of jargon: commonly used phrases which are part of the culture of mathematics, rather than of the subject. Jargon often appears i ...
(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 In the formal sciences, the domain of discourse, also called the universe of discourse, universal set, or simply universe, is the set of entities over which certain variables of interest in some formal treatment may range. Overview The dom ...
, ''z'' is in ''X'' if and only if ''z'' is in ''Y''."


See also

*
Equivalence relation In mathematics, an equivalence relation is a binary relation that is reflexive, symmetric and transitive. The equipollence relation between line segments in geometry is a common example of an equivalence relation. Each equivalence relatio ...
*
Logical biconditional In logic and mathematics, the logical biconditional, sometimes known as the material biconditional, is the logical connective (\leftrightarrow) used to conjoin two statements and to form the statement " if and only if ", where is known as t ...
* Logical equality *
Logical equivalence In logic and mathematics, statements p and q are said to be logically equivalent if they have the same truth value in every model. The logical equivalence of p and q is sometimes expressed as p \equiv q, p :: q, \textsfpq, or p \iff q, depending ...
*
Polysyllogism A polysyllogism (also called multi-premise syllogism, sorites, climax, or gradatio) is a string of any number of propositions forming together a sequence of syllogisms such that the conclusion of each syllogism, together with the next proposition, ...


References


External links

*
Language Log: "Just in Case"Southern California Philosophy for philosophy graduate students: "Just in Case"
{{Common logical symbols Logical connectives Mathematical terminology Necessity and sufficiency