Math 2.0

example

Two-element Boolean algebra

Example

The two-element Boolean algebra is the set {0,1}\{0, 1\} with these operations. a∧b=1a \wedge b = 1 if and only if a=b=1a = b = 1. a∨b=0a \vee b = 0 if and only if a=b=0a = b = 0. ¬0=1\neg 0 = 1 and ¬1=0\neg 1 = 0. It satisfies the axioms of a Boolean algebra, with 00 as least element and 11 as greatest element.

Remarks

If 11 means true and 00 means false, then ∧\wedge, ∨\vee and ¬\neg are the connectives and, or and not. An equation in the Boolean operations holds in all Boolean algebras if and only if it holds in the two-element Boolean algebra. It is isomorphic to the power set of a set with one element.

Explanations

L1 human

The two-element Boolean algebra is the algebra of true and false. It is also the algebra of one bit in a digital circuit.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Two-element_Boolean_algebra, Definition