The truth value of a compound statement can be determined from the truth values of its components. A table that gives, for all possible truth values of the components, the resulting truth values of the compound statement is a truth table. The truth table for ¬p is
and combined truth tables for p ∧ q, p ∨ q, and p⇒q are as follows:
From these, any other truth table can be completed. For example, the final column below, gives the truth table for the compound statement (p ∧ q) ∨ (¬r), and is found by first completing columns for p ∧ q and ¬r:
1. A tabular description of a combinational circuit (such as an AND gate, OR gate, NAND gate), listing all possible states of the input variables together with a statement of the output variable(s) for each of those possible states.
2. A tabular description of a logic operation (such as AND, OR, NAND), listing all possible combinations of the truth values—i.e. true (T) or false (F)—of the operands together with the truth value of the outcome for each of the possible combinations.
A table used in formal logic that lists the truth or falsity of the outcome when a logical operator, such as ‘and’ or ‘or’, is applied to combinations of logical statements. The truth table has been adapted to describe the operation of logic circuits by listing the outputs of a binary logic gate, such as a NAND circuit or flip-flop, for all possible combinations of inputs. The ‘true’ state corresponds to the voltage level representing a logical 1 and ‘false’ to logical 0.
See truth function.
- strong negation
- strong nuclear force
- strong password
- strong typing
- strontia
- strontianite
- strontium
- strontium bicarbonate
- strontium carbonate
- strontium chloride
- strontium hydrogencarbonate
- strontium oxide
- strontium star
- strontium sulphate
- strophic
- Strophomenida
- strophomenids
- Stroustrup, Bjarne (1950–)
- structural adjustment
- structural break
- structural consequence relation
- structural contour map
- adapical
- adaptation
- adaptive channel allocation