Information about If And Only If
↔
⇔
≡
⇔
≡
logical symbols
representing iff.
representing iff.
“Iff” redirects here. For other uses, see IFF.
If and only if, in logic and fields that rely on it such as mathematics and philosophy, is a logical connective between statements which means that the truth of either one of the statements requires the truth of the other. Thus, either both statements are true, or both are false.
In writing, common alternative phrases to "if and only if" include iff, Q is necessary and sufficient for P, P is equivalent to Q, P precisely if Q, P precisely (or exactly) when Q, P exactly in case Q, and P just in case Q. Many authors regard "iff" as unsuitable in formal writing; others use it freely.
The statement "(P iff Q)" is equivalent to the statement "not (P xor Q)" or "P == Q" in computer science.
In logic formulas, logical symbols are used instead of these phrases; see the discussion of notation.
Definition
The truth table of p iff q (also written as p ↔ q) is as follows:| p | q | p ↔ q |
|---|---|---|
| T | T | T |
| T | F | F |
| F | T | F |
| F | F | T |
Usage
Notation
The corresponding logical symbols are "↔", "⇔" and "≡", 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).Another term for this logical connective is exclusive nor.
Proofs
In most logical systems, one proves a statement of the form "P iff Q" by proving "if P, then Q" and "if Q, then P" (or the inverse of "if P, then Q", i.e. "if not P, then not Q"). Proving this 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 "(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 both been shown true, or both false.Origin of the abbreviation
Usage of the abbreviation "iff" first appeared in print in John L. Kelley's 1955 book General Topology. Its invention is often credited to the mathematician Paul Halmos, but in his autobiography he states that he borrowed it from puzzlers.The difference between if, only if, and iff
Examples
- Madison will eat pudding if the pudding is a custard. (equivalently: If the pudding is a custard, then Madison will eat it)
- Madison will eat pudding only if the pudding is a custard. (equivalently: If Madison is eating pudding, then it must be a custard)
- Madison will eat pudding if and only if (iff) the pudding is a custard.
Analysis
Sentence (1) states only that Madison will eat custard pudding. It does not however preclude the possibility that Madison might also have occasion to eat bread pudding. Maybe she will, maybe she will not - the sentence does not tell us. All we know for certain is that she will eat custard pudding.Sentence (2) states that the only pudding Madison will eat is a custard. It does not however preclude the possibility that Madison will refuse a custard if it is made available, in contrast with sentence (1), which requires Madison to eat any available custard.
Sentence (3) however makes it quite clear that Madison will eat custard pudding and custard pudding only. She will not eat any other type of pudding.
A further difference is that "if" is used in definitions (except in formal logic); see more below.
Advanced considerations
Philosophical interpretation
A sentence that is composed of two other sentences joined by "iff" is called a biconditional. "Iff" joins two sentences to form a new sentence. It should not be confused with logical equivalence which is a description of a relation between two sentences. The biconditional "A iff B" uses the sentences A and B, describing a relation between the states of affairs A and B describe. By contrast "A is logically equivalent to B" mentions both sentences: it describes a relation between those two sentences, and not between whatever matters they describe.The distinction is a very confusing one, and has led many a philosopher astray. Certainly it is the case that when A is logically equivalent to B, "A iff B" is true. But the converse does not hold. Reconsidering the sentence:
- Madison will eat pudding if and only if it is custard.
There is clearly no logical equivalence between the two halves of this particular biconditional. For more on the distinction, see W. V. Quine's Mathematical Logic, Section 5.
One way of looking at A if and only if B is that it means A if B (B implies A) and A only when B (not B implies not A). Not B implies not A means A implies B, so then we get two way implication.
Definitions
In philosophy and logic, "iff" is used to indicate definitions, since definitions are supposed to be universally quantified biconditionals. In mathematics and elsewhere, however, the word "if" is normally used in definitions, rather than "iff". This is due to the observation that "if" in the English language has a definitional meaning, separate from its meaning as a propositional conjunction. This separate meaning can be explained by noting that a definition (for instance: A group is "abelian" if it satisfies the commutative law; or: A grape is a "raisin" if it is well dried) is not an equivalence to be proved, but a rule for interpreting the term defined. (Some authors, nevertheless, explicitly indicate that the "if" of a definition means "iff"!)Examples
Here are some examples of true statements that use "iff" - true biconditionals (the first is an example of a definition, so it should normally have been written with "if"):- A person is a bachelor iff that person is an unmarried but marriageable man.
- "Snow is white" (in English) is true iff "Schnee ist weiß" (in German) is true.
- For any p, q, and r: (p & q) & r iff p & (q & r). (Since this is written using variables and "&", the statement would usually be written using "↔", or one of the other symbols used to write biconditionals, in place of "iff").
- For any real numbers x and y, x=y+1 iff y=x−1.
Analogs
Other words are also sometimes emphasized in the same way by repeating the last letter; for example orr for "Or and only Or" (the exclusive disjunction).The statement "(A iff B)" is equivalent to the statement "(not A or B) and (not B or A)," and is also equivalent to the statement "(not A and not B) or (A and B)."
More general usage
Iff is used outside the field of logic, 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. (However, as noted above, if, rather than iff, is more often used in statements of definition.)The elements of X are all and only the elements of Y is used to mean: "for any z in the domain of discourse, z is in X if and only if z is in Y."
See also
IFF, Iff or iff can stand for:
..... Click the link for more information.
- if and only if, a mathematical and logical connector indicating that either both statements are true or both are false
- Identification friend or foe, an electronic radio based identification system utilizing transponders
..... Click the link for more information.
Logic (from Classical Greek λόγος logos; meaning word, thought, idea, argument, account, reason, or principle) is the study of the principles and criteria of valid inference and demonstration.
..... Click the link for more information.
..... Click the link for more information.
Mathematics (colloquially, maths or math) is the body of knowledge centered on such concepts as quantity, structure, space, and change, and also the academic discipline that studies them. Benjamin Peirce called it "the science that draws necessary conclusions".
..... Click the link for more information.
..... Click the link for more information.
Philosophy is the discipline concerned with questions of how one should live (ethics); what sorts of things exist and what are their essential natures (metaphysics); what counts as genuine knowledge (epistemology); and what are the correct principles of reasoning (logic).
..... Click the link for more information.
..... Click the link for more information.
Editing of this page by unregistered or newly registered users is currently disabled.
If you are prevented from editing this page, and you wish to make a change, please discuss changes on the talk page, request unprotection, log in, or .
..... Click the link for more information.
If you are prevented from editing this page, and you wish to make a change, please discuss changes on the talk page, request unprotection, log in, or .
..... Click the link for more information.
necessary and sufficient condition of another means that the former statement is true if and only if the latter is true.
..... Click the link for more information.
- A necessary condition of a statement must be satisfied for the statement to be true.
..... Click the link for more information.
exclusive disjunction, also called exclusive or, (symbolized XOR or EOR), is a type of logical disjunction on two operands that results in a value of "true" if and only if exactly one of the operands has a value of "true.
..... Click the link for more information.
..... Click the link for more information.
formula is a formal syntactic object that expresses a proposition.
The exact definition of a formula depends on the particular development of formal logic in question, but a fairly typical one (specific to first-order logic) goes as follows: Formulas are defined relative to
..... Click the link for more information.
The exact definition of a formula depends on the particular development of formal logic in question, but a fairly typical one (specific to first-order logic) goes as follows: Formulas are defined relative to
..... Click the link for more information.
A truth table is a mathematical table used in logic — specifically in connection with Boolean algebra, boolean functions, and propositional calculus — to compute the functional values of logical expressions on each of their functional arguments, that is, on each
..... Click the link for more information.
..... Click the link for more information.
Mathematical logic is a branch of mathematics, which grew out of symbolic logic. Subfields include model theory, proof theory, set theory, and recursion theory. Research in mathematical logic has contributed to, and been motivated by, the study of foundations of mathematics, but
..... Click the link for more information.
..... Click the link for more information.
First-order logic (FOL) is a formal deductive system used by mathematicians, philosophers, linguists, and computer scientists. It goes by many names, including: first-order predicate calculus (FOPC), the lower predicate calculus,
..... Click the link for more information.
..... Click the link for more information.
In logic and mathematics, a propositional calculus (or a sentential calculus) is a formal system in which formulas representing propositions can be formed by combining atomic propositions using logical connectives, and a system of formal proof rules
..... Click the link for more information.
..... Click the link for more information.
The metalogic of a system of logic is the formal theory of the formal logic. Results in metalogic will consist of such things as formal proofs demonstrating the soundness of the logic.
..... Click the link for more information.
..... Click the link for more information.
Editing of this page by unregistered or newly registered users is currently disabled.
If you are prevented from editing this page, and you wish to make a change, please discuss changes on the talk page, request unprotection, log in, or .
..... Click the link for more information.
If you are prevented from editing this page, and you wish to make a change, please discuss changes on the talk page, request unprotection, log in, or .
..... Click the link for more information.
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 value, and false
..... Click the link for more information.
..... Click the link for more information.
Proof theory is a branch of mathematical logic that represents proofs as formal mathematical objects, facilitating their analysis by mathematical techniques. Proofs are typically presented as inductively-defined data structures such as plain lists, boxed lists, or trees, which are
..... Click the link for more information.
..... Click the link for more information.
Contraposition is the concept of how two qualities or statements relate to each other. In mathematics, for the statement "if P, then Q" for any two propositions P and Q, the converse is "if Q, then P", the inverse
..... Click the link for more information.
..... Click the link for more information.
or, also known as logical disjunction or inclusive disjunction is a logical operator that results in true whenever one or more of its operands are true. In grammar, or is a coordinating conjunction.
..... Click the link for more information.
..... Click the link for more information.
truth function is a function from a set of truth-values to truth-values. Classically the domain and range of a truth function are , but generally they may have any number of truth-values, including an infinity of them.
..... Click the link for more information.
..... Click the link for more information.
John Leroy Kelley (December 6 1916, Kansas – November 26 1999, Oakland, California) was an American mathematician at University of California, Berkeley who worked in general topology and functional analysis.
..... Click the link for more information.
..... Click the link for more information.
19th century - 20th century - 21st century
1920s 1930s 1940s - 1950s - 1960s 1970s 1980s
1952 1953 1954 - 1955 - 1956 1957 1958
Year 1955 (MCMLV
..... Click the link for more information.
1920s 1930s 1940s - 1950s - 1960s 1970s 1980s
1952 1953 1954 - 1955 - 1956 1957 1958
Year 1955 (MCMLV
..... Click the link for more information.
mathematician is a person whose primary area of study and research is the field of mathematics.
..... Click the link for more information.
Problems in mathematics
Some people incorrectly believe that mathematics has been fully understood, but the publication of new discoveries in mathematics continues at an immense..... Click the link for more information.
Paul Richard Halmos (March 3 1916 — October 2 2006) was a Hungarian-born American mathematician who made fundamental advances in the areas of probability theory, statistics, operator theory, ergodic theory, functional analysis (in particular, Hilbert spaces), and
..... Click the link for more information.
..... Click the link for more information.
autobiography, from the Greek autos, 'self', bios, 'life' and graphein, 'write', is a biography written by the subject or composed conjointly with a collaborative writer (styled "as told to" or "with").
..... Click the link for more information.
..... Click the link for more information.
puzzle is a problem or enigma that challenges ingenuity. In a basic puzzle you piece together objects in a logical way in order to come up with the desired shape, picture or solution.
..... Click the link for more information.
..... Click the link for more information.
In logic and mathematics, logical biconditional (sometimes also known as the material biconditional) is a logical operator connecting two statements to assert, p if and only if q where p is a hypothesis (or antecedent) and
..... Click the link for more information.
..... Click the link for more information.
In logic, statements p and q are logically equivalent if they have the same logical content.
Syntactically, p and q are equivalent if each can be proved from the other.
..... Click the link for more information.
Syntactically, p and q are equivalent if each can be proved from the other.
..... Click the link for more information.
Willard Van Orman Quine (June 25, 1908 – December 25, 2000), usually cited as W.V. Quine or W.V.O. Quine but known to his friends as Van, was one of the most influential philosophers and logicians of the 20th century.
..... Click the link for more information.
..... Click the link for more information.
A definition is a statement of the meaning of a term, word or phrase. The term to be defined is known as the definiendum (Latin: that which is to be defined).
..... Click the link for more information.
..... Click the link for more information.
In predicate logic, universal quantification is an attempt to formalize the notion that something (a logical predicate) is true for everything, or every relevant thing.
..... Click the link for more information.
..... Click the link for more information.
This article is copied from an article on Wikipedia.org - the free encyclopedia created and edited by online user community. The text was not checked or edited by anyone on our staff. Although the vast majority of the wikipedia encyclopedia articles provide accurate and timely information please do not assume the accuracy of any particular article. This article is distributed under the terms of GNU Free Documentation License.
Herod_Archelaus