((A → B)·(B → C)) → (A → C) — truth table

coretautology: all 8 rows true

Answer

8 rows, 8 true (0, 1, 2, 3, 4, 5, 6, 7)

Why this example is worth doing

Hypothetical syllogism, and the first example on the page whose output column is constant. A tautology is how you prove an argument valid: build the implication from premises to conclusion and show it cannot be false. The tool labels the result as a tautology rather than leaving the reader to scan eight rows, and reports the same for contradictions and contingencies. This is the propositional-logic use of the truth table generator, which is a different search intent from the digital-logic one.

Try your own input in the Truth table generator. Turn an expression into a full truth table, with a column for every sub-expression.

How the answer is reached

Truth table

Truth table — columns #, A, B, C, (A → B) · (B → C) → A → C
#ABC(A → B) · (B → C) → A → C
00001
10011
20101
30111
41001
51011
61101
71111

Compare with

Open this example in the Truth table generator

The field arrives filled in with this example’s input.

Note:

Notation this page assumes

  • Symbols: · is AND, + is OR, ⊕ is XOR, a prime or an overline is NOT. The field also takes ∧ ∨ ¬ ~ ! & | and the words.
  • Operator precedence, tightest first: NOT, then AND (including juxtaposition), then XOR/XNOR, then NAND/NOR, then OR, then IMPLIES, then IFF.
  • In a minterm index the first variable is the most significant bit, so over [A, B, C] minterm 5 is A·B̄·C.

Sources

  • Boole, An Investigation of the Laws of Thought (1854)
  • Shannon, “A Symbolic Analysis of Relay and Switching Circuits” (1938)