Linked from

The 43 pages that link to Truth table, each with the reason it gives.

• Propositional logicRelated: Truth tables give a direct way to evaluate formulas in propositional logic.

• Classical logicRelated: Truth tables decide validity for finite propositional arguments.

• NegationRelated: Its two-row pattern gives negation’s complete behavior for a single proposition.

• Logic gateRelated: It specifies a gate’s behavior independently of its circuit design.

• Logical connectiveRelated: It gives a complete account of a truth-functional connective's behavior.

• TruthBroader topic: It makes the truth conditions of logical connectives explicit.

• Truth valueRelated: Truth tables make the evaluation of compound propositions explicit.

• Logical equivalenceRelated: Comparing two columns checks equivalence across all propositional valuations.

• Law of Excluded MiddleRelated: A classical truth table shows P ∨ ¬P is true under both assignments for P.

• SatisfiabilityRelated: For finite propositional formulas, a truth table directly checks whether any assignment satisfies the formula.

• Logical implicationRelated: Its four rows make the implication's sole false case explicit.

• Many-valued logicRelated: Truth tables make a many-valued connective's behavior explicit.

• Boolean functionRelated: A truth table gives the complete behavior of a Boolean function in explicit form.

• Modus tollensRelated: A truth table verifies that no case makes the premises true and the conclusion false.

• DisjunctionRelated: Its rows specify exactly when a disjunction is true or false.

• LogicRelated: Truth tables test validity in classical propositional logic by checking all cases.

• NAND gateNarrower topic: Truth tables define NAND precisely, including for gates with more than two inputs.

• Exclusive orNarrower topic: Its four rows define when exclusive or is true and false.

• OR gateRelated: The OR gate's table makes its output rule explicit for each input pair.

• AND gateRelated: The AND gate’s output is false for every input combination except the all-true row.

• Logical formBroader topic: Truth tables test whether a propositional form preserves truth under every assignment.

• Logical validityRelated: Truth tables test whether any assignment makes the premises true and conclusion false.

• Material conditionalRelated: Its four rows define the material conditional’s truth conditions.

• NOT gateRelated: The NOT gate’s entire behavior is captured by two input-output rows.

• Disjunctive syllogismRelated: A truth table verifies that no true premises yield a false conclusion in the standard form.

• XOR gateRelated: It gives the XOR gate’s complete behavior for binary inputs.

• Affirming the consequentRelated: A case where P is false and Q true exposes the inference’s invalidity.

• Karnaugh mapNarrower topic: A Karnaugh map rearranges truth-table rows into a grid suited to visual grouping.

• Symbolic logicRelated: Truth tables mechanically evaluate propositional formulas and test arguments.

• Disjunction eliminationRelated: Truth tables verify the rule by checking every assignment to the disjuncts.

• Disjunction introductionRelated: Truth tables show why a true premise guarantees the introduced disjunction in classical logic.

• Logical atomismRelated: Truth tables show how complex propositions depend on elementary ones.

• Tractatus Logico-PhilosophicusRelated: Truth-functional notation shows how complex propositions depend on elementary ones.

• Biconditional introductionCompared with: Truth tables test equivalence semantically rather than introducing a conclusion through proof steps.

• Boolean networkRelated: It gives a complete finite specification of an update rule.

• Conjunction introductionRelated: Its conjunction column verifies the rule’s truth-preserving pattern.

• Venn diagramRelated: Each region can represent one combination of membership conditions, as a row represents an assignment.

• Constructive dilemmaRelated: A truth table verifies that the rule preserves truth across all assignments.

• De Morgan's lawsRelated: Truth tables verify both identities for propositional logic.

• Sheffer strokeNarrower topic: Its four rows give the Sheffer stroke’s complete truth condition.

• If and only ifRelated: Its rows make clear that a biconditional is true when both sides match.

• Logic (digital electronics)Related: Truth tables specify circuit behavior before it is built from gates.

• Modus ponendo tollensRelated: A truth table shows the conclusion follows whenever the premises are true.