When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Contraposition - Wikipedia

    en.wikipedia.org/wiki/Contraposition

    The previous example employed the contrapositive of a definition to prove a theorem. One can also prove a theorem by proving the contrapositive of the theorem's statement. To prove that if a positive integer N is a non-square number , its square root is irrational , we can equivalently prove its contrapositive, that if a positive integer N has ...

  3. Modus tollens - Wikipedia

    en.wikipedia.org/wiki/Modus_tollens

    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. The history of the inference rule modus tollens goes back to antiquity. [4]

  4. Inverse (logic) - Wikipedia

    en.wikipedia.org/wiki/Inverse_(logic)

    The inverse and the converse of a conditional are logically equivalent to each other, just as the conditional and its contrapositive are logically equivalent to each other. [1] But the inverse of a conditional cannot be inferred from the conditional itself (e.g., the conditional might be true while its inverse might be false [2]). For example ...

  5. Proving a negative - Wikipedia

    en.wikipedia.org/wiki/Proving_a_negative

    Proving a negative or negative proof may refer to: Proving a negative, in the philosophic burden of proof; Evidence of absence in general, such as evidence that there is no milk in a certain bowl; Modus tollens, a logical proof; Proof of impossibility, mathematics; Russell's teapot, an analogy: inability to disprove does not prove

  6. Proof by contradiction - Wikipedia

    en.wikipedia.org/wiki/Proof_by_contradiction

    Such a proof is again a refutation by contradiction. A typical example is the proof of the proposition "there is no smallest positive rational number": assume there is a smallest positive rational number q and derive a contradiction by observing that ⁠ q / 2 ⁠ is even smaller than q and still positive.

  7. Obversion - Wikipedia

    en.wikipedia.org/wiki/Obversion

    In traditional logic, obversion is a "type of immediate inference in which from a given proposition another proposition is inferred whose subject is the same as the original subject, whose predicate is the contradictory of the original predicate, and whose quality is affirmative if the original proposition's quality was negative and vice versa". [1]

  8. Negative number - Wikipedia

    en.wikipedia.org/wiki/Negative_number

    Negative numbers are used to describe values on a scale that goes below zero, such as the Celsius and Fahrenheit scales for temperature. The laws of arithmetic for negative numbers ensure that the common-sense idea of an opposite is reflected in arithmetic. For example, − ‍ (−3) = 3 because the opposite of an opposite is the original value.

  9. Affirming the consequent - Wikipedia

    en.wikipedia.org/wiki/Affirming_the_consequent

    Example 1. One way to demonstrate the invalidity of this argument form is with a counterexample with true premises but an obviously false conclusion. For example: If someone lives in San Diego, then they live in California. Joe lives in California. Therefore, Joe lives in San Diego. There are many places to live in California other than San Diego.