Vacuous truth

Last updated

In mathematics and logic, a vacuous truth is a conditional or universal statement (a universal statement that can be converted to a conditional statement) that is true because the antecedent cannot be satisfied. [1] It is sometimes said that a statement is vacuously true because it does not really say anything. [2] For example, the statement "all cell phones in the room are turned off" will be true when no cell phones are present in the room. In this case, the statement "all cell phones in the room are turned on" would also be vacuously true, as would the conjunction of the two: "all cell phones in the room are turned on and turned off", which would otherwise be incoherent and false.

Contents

More formally, a relatively well-defined usage refers to a conditional statement (or a universal conditional statement) with a false antecedent. [1] [3] [2] [4] One example of such a statement is "if Tokyo is in Spain, then the Eiffel Tower is in Bolivia".

Such statements are considered vacuous truths because the fact that the antecedent is false prevents using the statement to infer anything about the truth value of the consequent. In essence, a conditional statement, that is based on the material conditional, is true when the antecedent ("Tokyo is in Spain" in the example) is false regardless of whether the conclusion or consequent ("the Eiffel Tower is in Bolivia" in the example) is true or false because the material conditional is defined in that way.

Examples common to everyday speech include conditional phrases used as idioms of improbability like "when hell freezes over ..." and "when pigs can fly ...", indicating that not before the given (impossible) condition is met will the speaker accept some respective (typically false or absurd) proposition.

In pure mathematics, vacuously true statements are not generally of interest by themselves, but they frequently arise as the base case of proofs by mathematical induction. [5] This notion has relevance in pure mathematics, as well as in any other field that uses classical logic.

Outside of mathematics, statements in the form of a vacuous truth, while logically valid, can nevertheless be misleading. Such statements make reasonable assertions about qualified objects which do not actually exist. For example, a child might truthfully tell their parent "I ate every vegetable on my plate", when there were no vegetables on the child's plate to begin with. In this case, the parent can believe that the child has actually eaten some vegetables, even though that is not true.

Scope of the concept

A statement is "vacuously true" if it resembles a material conditional statement , where the antecedent is known to be false. [1] [3] [2]

Vacuously true statements that can be reduced (with suitable transformations) to this basic form (material conditional) include the following universally quantified statements:

Vacuous truths most commonly appear in classical logic with two truth values. However, vacuous truths can also appear in, for example, intuitionistic logic, in the same situations as given above. Indeed, if is false, then will yield a vacuous truth in any logic that uses the material conditional; if is a necessary falsehood, then it will also yield a vacuous truth under the strict conditional.

Other non-classical logics, such as relevance logic, may attempt to avoid vacuous truths by using alternative conditionals (such as the case of the counterfactual conditional).

In computer programming

Many programming environments have a mechanism for querying if every item in a collection of items satisfies some predicate. It is common for such a query to always evaluate as true for an empty collection. For example:

Examples

These examples, one from mathematics and one from natural language, illustrate the concept of vacuous truths:

See also

Related Research Articles

First-order logic—also called predicate logic, predicate calculus, quantificational logic—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantified variables over non-logical objects, and allows the use of sentences that contain variables. Rather than propositions such as "all men are mortal", in first-order logic one can have expressions in the form "for all x, if x is a man, then x is mortal"; where "for all x" is a quantifier, x is a variable, and "... is a man" and "... is mortal" are predicates. This distinguishes it from propositional logic, which does not use quantifiers or relations; in this sense, propositional logic is the foundation of first-order logic.

In propositional logic, modus ponens, also known as modus ponendo ponens, implication elimination, or affirming the antecedent, is a deductive argument form and rule of inference. It can be summarized as "P implies Q.P is true. Therefore, Q must also be true."

In propositional logic, modus tollens (MT), also known as modus tollendo tollens and denying the consequent, is a deductive argument form and a rule of inference. Modus tollens is a mixed hypothetical syllogism that takes the form of "If P, then Q. Not Q. Therefore, not P." It is an application of the general truth that if a statement is true, then so is its contrapositive. The form shows that inference from P implies Q to the negation of Q implies the negation of P is a valid argument.

In mathematical logic, a universal quantification is a type of quantifier, a logical constant which is interpreted as "given any", "for all", or "for any". It expresses that a predicate can be satisfied by every member of a domain of discourse. In other words, it is the predication of a property or relation to every member of the domain. It asserts that a predicate within the scope of a universal quantifier is true of every value of a predicate variable.

In predicate logic, an existential quantification is a type of quantifier, a logical constant which is interpreted as "there exists", "there is at least one", or "for some". It is usually denoted by the logical operator symbol ∃, which, when used together with a predicate variable, is called an existential quantifier ("x" or "∃(x)" or "(∃x)"). Existential quantification is distinct from universal quantification ("for all"), which asserts that the property or relation holds for all members of the domain. Some sources use the term existentialization to refer to existential quantification.

In logic and mathematics, the converse of a categorical or implicational statement is the result of reversing its two constituent statements. For the implication PQ, the converse is QP. For the categorical proposition All S are P, the converse is All P are S. Either way, the truth of the converse is generally independent from that of the original statement.

<span class="mw-page-title-main">Negation</span> Logical operation

In logic, negation, also called the logical not or logical complement, is an operation that takes a proposition to another proposition "not ", written , , or . It is interpreted intuitively as being true when is false, and false when is true. For example, if is "Spot runs", then "not " is "Spot does not run". An operand of a negation is called a negand or negatum.

In logic and mathematics, necessity and sufficiency are terms used to describe a conditional or implicational relationship between two statements. For example, in the conditional statement: "If P then Q", Q is necessary for P, because the truth of Q is guaranteed by the truth of P. Similarly, P is sufficient for Q, because P being true always implies that Q is true, but P not being true does not always imply that Q is not true.

<span class="mw-page-title-main">Logical biconditional</span> Concept in logic and mathematics

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 and to form the statement " if and only if ", where is known as the antecedent, and the consequent.

In mathematical logic, sequent calculus is a style of formal logical argumentation in which every line of a proof is a conditional tautology instead of an unconditional tautology. Each conditional tautology is inferred from other conditional tautologies on earlier lines in a formal argument according to rules and procedures of inference, giving a better approximation to the natural style of deduction used by mathematicians than David Hilbert's earlier style of formal logic, in which every line was an unconditional tautology. More subtle distinctions may exist; for example, propositions may implicitly depend upon non-logical axioms. In that case, sequents signify conditional theorems of a first-order theory rather than conditional tautologies.

A formula of the predicate calculus is in prenex normal form (PNF) if it is written as a string of quantifiers and bound variables, called the prefix, followed by a quantifier-free part, called the matrix. Together with the normal forms in propositional logic, it provides a canonical normal form useful in automated theorem proving.

Counterfactual conditionals are conditional sentences which discuss what would have been true under different circumstances, e.g. "If Peter believed in ghosts, he would be afraid to be here." Counterfactuals are contrasted with indicatives, which are generally restricted to discussing open possibilities. Counterfactuals are characterized grammatically by their use of fake tense morphology, which some languages use in combination with other kinds of morphology including aspect and mood.

<span class="mw-page-title-main">Material conditional</span> Logical connective

The material conditional is an operation commonly used in logic. When the conditional symbol is interpreted as material implication, a formula is true unless is true and is false. Material implication can also be characterized inferentially by modus ponens, modus tollens, conditional proof, and classical reductio ad absurdum.

The drinker paradox is a theorem of classical predicate logic that can be stated as "There is someone in the pub such that, if he or she is drinking, then everyone in the pub is drinking." It was popularised by the mathematical logician Raymond Smullyan, who called it the "drinking principle" in his 1978 book What Is the Name of this Book?

In logic and mathematics, contraposition, or transposition, refers to the inference of going from a conditional statement into its logically equivalent contrapositive, and an associated proof method known as § Proof by contrapositive. The contrapositive of a statement has its antecedent and consequent inverted and flipped.

The paradoxes of material implication are a group of true formulae involving material conditionals whose translations into natural language are intuitively false when the conditional is translated as "if ... then ...". A material conditional formula is true unless is true and is false. If natural language conditionals were understood in the same way, that would mean that the sentence "If the Nazis had won World War Two, everybody would be happy" is vacuously true. Given that such problematic consequences follow from a seemingly correct assumption about logic, they are called paradoxes. They demonstrate a mismatch between classical logic and robust intuitions about meaning and reasoning.

Connexive logic is a class of non-classical logics designed to exclude the paradoxes of material implication. The characteristic that separates connexive logic from other non-classical logics is its acceptance of Aristotle's thesis, i.e. the formula, as a logical truth. Aristotle's thesis asserts that no statement follows from its own denial. Stronger connexive logics also accept Boethius' thesis, which states that if a statement implies one thing, it does not imply its opposite.

Markov's principle, named after Andrey Markov Jr, is a conditional existence statement for which there are many equivalent formulations, as discussed below. The principle is logically valid classically, but not in intuitionistic constructive mathematics. However, many particular instances of it are nevertheless provable in a constructive context as well.

Czesław Lejewski was a Polish philosopher and logician, and a member of the Lwow-Warsaw School of Logic. He studied under Jan Łukasiewicz and Karl Popper in the London School of Economics, and W. V. O. Quine.

In logic, a quantifier is an operator that specifies how many individuals in the domain of discourse satisfy an open formula. For instance, the universal quantifier in the first order formula expresses that everything in the domain satisfies the property denoted by . On the other hand, the existential quantifier in the formula expresses that there exists something in the domain which satisfies that property. A formula where a quantifier takes widest scope is called a quantified formula. A quantified formula must contain a bound variable and a subformula specifying a property of the referent of that variable.

References

  1. 1 2 3 "Vacuously true". web.cse.ohio-state.edu. Archived from the original on 18 November 2023. Retrieved 15 December 2019.
  2. 1 2 3 "Vacuously true - CS2800 wiki". courses.cs.cornell.edu. Archived from the original on 21 June 2023. Retrieved 15 December 2019.
  3. 1 2 "Definition:Vacuous Truth – ProofWiki". proofwiki.org. Retrieved 2019-12-15.
  4. 1 2 Edwards, C. H. (January 18, 1998). "Vacuously True" (PDF). swarthmore.edu. Archived from the original (PDF) on 28 April 2021. Retrieved 14 December 2019.
  5. Baldwin, Douglas L.; Scragg, Greg W. (2011), Algorithms and Data Structures: The Science of Computing, Cengage Learning, p. 261, ISBN   978-1-285-22512-8
  6. "Array.prototype.every() - JavaScript | MDN". developer.mozilla.org. 27 November 2023.
  7. "Built-in Functions – Python 3.10.2 documentation". docs.python.org.
  8. "Iterator in std::iter – Rust". doc.rust-lang.org.
  9. "The ANY_VALUE(…) Aggregate Function". modern-sql.com. Retrieved 2024-11-27.
  10. "std::all_of, std::any_of, std::none_of". Cpprefeference. 19 March 2024. Archived from the original on 1 December 2024. Retrieved 9 December 2024.
  11. "logic – What precisely is a vacuous truth?". Mathematics Stack Exchange.

Bibliography