A = 1 — NOT gate

introthe whole gate in one row

Answer

output 0

Why this example is worth doing

The simplest permalink on the site: one input, one output, inverted. The page opens with it because a NOT gate's entire behaviour is two rows, and the interesting content is everything around it — notation, symbol, and the fact that inversion is what makes a Boolean algebra rather than a lattice. Without complement there is no De Morgan, no NAND, and no minimisation worth the name.

Try your own input in the NOT gate. Truth table, symbol and algebraic form for the inverter, Ā.

How the answer is reached

The probed row

A = 10Row 1 of 2.

Truth table

Truth table — columns #, A, A′
#AA′
001
110

Compare with

Open this example in the NOT gate

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.
  • Gate symbols follow whichever standard the header toggle is set to: ANSI/IEEE Std 91-1984 distinctive shapes, or IEC 60617-12 rectangles.

Sources

  • ANSI/IEEE Std 91-1984, Graphic Symbols for Logic Functions
  • IEC 60617-12, Graphical Symbols for Diagrams — Binary Logic Elements