A ↑ B — truth table
edge casefalse only when both inputs are 1
Answer
4 rows, 3 true (0, 1, 2)
Why this example is worth doing
The Sheffer stroke, written ↑, which this parser accepts as NAND — and never as the OR that the similar-looking pipe character means. That collision is a genuine source of wrong answers when text is pasted from a discrete-maths course into a digital-logic tool, so the page says which is which. The table is the AND table with the output column inverted, and the page notes that this one connective is functionally complete: every other table on this page can be built from copies of it.
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
| # | A | B | A ↑ B |
|---|---|---|---|
| 0 | 0 | 0 | 1 |
| 1 | 0 | 1 | 1 |
| 2 | 1 | 0 | 1 |
| 3 | 1 | 1 | 0 |