There is no RationalWiki without you. We are a small non-profit with no staff – we are hundreds of volunteers who document pseudoscience and crankery around the world every day. We will never allow ads because we must remain independent. We cannot rely on big donors with corresponding big agendas. We are not the largest website around, but we believe we play an important role in defending truth and objectivity. If everyone who saw this today donated $5, we would meet our goal for 2020. |
Fighting pseudoscience isn't free. We are 100% user-supported! Help and donate $5, $20 or whatever you can today with ! |
Truth table
Part of the series on Logic and rhetoric |
Key articles |
General logic |
Bad logic |
A truth table is a table that lists all possible states of a statement.^{[1]} Truth tables are commonly used to compare statements; if two statements share the same truth table, then the two statements are said to be logically equivalent. Truth tables are also able to be used to find negations of statements.
Contents
Equivalent statements[edit]
If two statements, and , have truth tables that contain the same elements, then the two statements are logically equivalent.^{[2]}^{[3]} That is, the two statements will be true or false under the same conditions. and being logically equivalent is denoted as: . Finding equivalent statements is a tool used in mathematics as it may be difficult to directly prove one statement, but easy to prove an equivalent statement.
Example of equivalent statements[edit]
One can show that, for two statements and , is logically equivalent to by showing that they have the same truth table. Consider the truth table for :
T | T | T |
F | F | T |
T | F | F |
F | T | T |
In the above table, T is true and F is false. Now consider the truth table for :
T | T | T |
F | F | T |
T | F | F |
F | T | T |
Observing the two tables, they have the same elements. Thus, is logically equivalent to .
Negation of statements[edit]
Given a statement , another statement is the negation of if the state of is opposite of given the same conditions. That is, is false when is true, and is true when is false. If this holds, then is the negation of , written as (sometimes as ~).^{[4]}
T | F |
F | T |
The negation of , , is visualized in the above truth table.
Example of negated statements[edit]
One can show that is the negation of via a truth table.
T | T | T | F |
F | F | T | F |
T | F | F | T |
F | T | T | F |
See also[edit]
External links[edit]
Truth Tables, Tautologies, and Logical Equivalences