Ads
related to: contrapositive inverse and converse statement worksheet printable middle school
Search results
Results From The WOW.Com Content Network
Let S be a statement of the form P implies Q (P → Q). Then the converse of S is the statement Q implies P (Q → P). In general, the truth of S says nothing about the truth of its converse, [2] unless the antecedent P and the consequent Q are logically equivalent. For example, consider the true statement "If I am a human, then I am mortal."
If a statement's inverse is false, then its converse is false (and vice versa). If a statement's negation is false, then the statement is true (and vice versa). If a statement (or its contrapositive) and the inverse (or the converse) are both true or both false, then it is known as a logical biconditional.
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 ...
In propositional logic, affirming the consequent (also known as converse error, fallacy of the converse, or confusion of necessity and sufficiency) is a formal fallacy (or an invalid form of argument) that is committed when, in the context of an indicative conditional statement, it is stated that because the consequent is true, therefore the ...
The converse does however not hold in general, unless the excluded middle statement at hand is stable itself. An implication ψ → ¬ ϕ {\displaystyle \psi \to \neg \phi } can be proven to be equivalent to ¬ ¬ ψ → ¬ ϕ {\displaystyle \neg \neg \psi \to \neg \phi } , whatever the propositions.
Given a type A statement, "All S are P.", one can make the immediate inference that "All non-P are non-S" which is the contrapositive of the given statement. Given a type O statement, "Some S are not P.", one can make the immediate inference that "Some non-P are not non-S" which is the contrapositive of the given statement.
Although many functions do not have an inverse, every relation does have a unique converse. The unary operation that maps a relation to the converse relation is an involution , so it induces the structure of a semigroup with involution on the binary relations on a set, or, more generally, induces a dagger category on the category of relations ...
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]