Difference between revisions of "Logical Implication"

From Department of Mathematics at UTSA
Jump to navigation Jump to search
Line 1: Line 1:
A logical implication is a relationship between two statements. If a statement Q is always true when another statement P is true, then we say that "P implies Q", which is denoted symbolically as <math> P \implies Q </math>. Note that if P is false, Q does not necessarily have to be false. For example, if x > 10, then x is also greater than 0, so we can say that "<math> x > 10 \implies x > 0 </math>". However, if x is less than 10, it doesn't necessarily mean that x isn't greater than 0. That is, <math> x > 10 \implies x > 0 </math> does NOT mean that <math> x \le 10 \implies x \le 0 </math>. The truth table for logical implication is as follows:
+
A logical implication is a relationship between two statements. If a statement <math> Q </math> is always true when another statement <math> P </math> is true, then we say that <math> P </math> implies <math> Q </math>, which is denoted symbolically as <math> P \implies Q </math>. Note that if <math> P </math> is false, <math> Q </math> does not necessarily have to be false. For example, if <math> x > 10 </math>, then <math> x > 0 </math>, so we can say that "<math> x > 10 \implies x > 0 </math>". However, if x is less than 10, it doesn't necessarily mean that x isn't greater than 0. That is, <math> x > 10 \implies x > 0 </math> does NOT mean that <math> x \le 10 \implies x \le 0 </math>. The truth table for logical implication is as follows:
  
 
{| class="wikitable" style="margin:1em auto 1em auto; text-align:center;"
 
{| class="wikitable" style="margin:1em auto 1em auto; text-align:center;"
Line 14: Line 14:
 
|}
 
|}
  
Note that while the inverse of <math> P \implies Q </math> (that is, <math> \neg P \implies \neg Q </math>) does not necessarily have the same truth value as <math> P \implies Q </math>, the contrapositive (<math> \neg Q \implies \neg P </math>) does. For example, <math> x > 10 \implies x > 0 </math> and its contrapositive, <math> x \leq 0 \implies x \leq 10 </math>, are logically equivalent, and always have the same truth value for any number x.
+
Note that while the inverse of <math> P \implies Q </math> (that is, <math> \neg P \implies \neg Q </math>) does not necessarily have the same truth value as <math> P \implies Q </math>, the contrapositive (<math> \neg Q \implies \neg P </math>) does. For example, <math> x > 10 \implies x > 0 </math> and its contrapositive, <math> x \leq 0 \implies x \leq 10 </math>, are logically equivalent, and always have the same truth value for any number <math> x </math>.
  
 
==Resources==
 
==Resources==
 
* [https://sites.millersville.edu/bikenaga/math-proof/truth-tables/truth-tables.html Truth Tables, Tautologies, and Logical Equivalences], Millersville University
 
* [https://sites.millersville.edu/bikenaga/math-proof/truth-tables/truth-tables.html Truth Tables, Tautologies, and Logical Equivalences], Millersville University

Revision as of 13:13, 27 September 2021

A logical implication is a relationship between two statements. If a statement is always true when another statement is true, then we say that implies , which is denoted symbolically as . Note that if is false, does not necessarily have to be false. For example, if , then , so we can say that "". However, if x is less than 10, it doesn't necessarily mean that x isn't greater than 0. That is, does NOT mean that . The truth table for logical implication is as follows:

T T T
T F F
F T T
F F T

Note that while the inverse of (that is, ) does not necessarily have the same truth value as , the contrapositive () does. For example, and its contrapositive, , are logically equivalent, and always have the same truth value for any number .

Resources