Jump to content

Minimal axioms for Boolean algebra

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Badtoothfairy (talk | contribs) at 19:56, 6 November 2018. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Wolfram axiom is the result of a computer exploration undertaken by Stephen Wolfram[1] in his A New Kind of Science looking for the shortest single axiom equivalent to the axioms of Boolean algebra (or propositional calculus). The result[2] of his search was an axiom with six NAND operations and three variables equivalent to Boolean algebra:

where the vertical bar represents the NAND logical operation (also known as the Sheffer stroke).

Wolfram’s 25 candidates are precisely the set of Sheffer identities of length less or equal to 15 elements (excluding mirror images) that have no noncommutative models of size less or equal to 4 (variables).[3]

Researchers have known for some time that single equational axioms (i.e., 1-bases) exist for Boolean algebra,[4] including representation in terms of disjunction and negation and in terms of the Sheffer stroke. Wolfram proved[5][6] that his equation is a single equational axiom for Boolean algebra, and he proved[7] that there were no smaller single equational axioms for Boolean algebra expressed only with the NAND operation.

Proof of Wolfram's Axiom for Boolean Algebra

The steps in an automated proof of the correctness of Wolfram's Axiom have been published in the Wolfram Data Repository.[6] Each step states what is being proved and gives a list of the steps required for a proof. Each individual step in the proof is performed by inserting the specified axiom or lemma, essentially using pattern matching, but with substitutions and rearrangements for variables being made.

See also

Notes

  1. ^ Wolfram, 2002, p. 808–811 and 1174.
  2. ^ Rudy Rucker, A review of NKS, The Mathematical Association of America, Monthly 110, 2003.
  3. ^ William Mccune, Robert Veroff, Branden Fitelson, Kenneth Harris, Andrew Feist and Larry Wos, Short Single Axioms for Boolean algebra, J. Automated Reasoning, 2002.
  4. ^ Padmanabhan, R.; Quackenbush, R. W. (1973)
  5. ^ Wolfram, 2002, p. 810–811.
  6. ^ a b "Proof of Wolfram's Axiom for Boolean Algebra".
  7. ^ Wolfram, 2002, p. 1174.

References