# Proof of Wolfram's Axiom for Boolean Algebra

Steps in an automated proof of the correctness of Wolfram’s Axiom

The goal is to prove as theorems the three standard Sheffer axioms of Boolean algebra from Wolfram's single axiom.

Each step states what is being proved, then gives a list of the steps required for a proof.

The result is a proof that Wolfram's Axiom is a complete axiom for Boolean algebra. It is the simplest possible one.

The proof was first given in very small type on pages 810 and 811 of "A New Kind of Science".

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.

## Examples

### Basic Examples

#### Retrieve the resource:

#### Show the corresponding proof:

#### Show the data associated with lemma 20:

#### Find the number of lemmas used in the proof:

#### Pick out the statements used on the first 5 steps:

#### Plot the lengths of the statements used on all steps:

#### Find the longest statement:

#### Show the statement as a tree:

#### Plot the lengths of the proofs used:

#### Find the chain of dependencies in the first 5 steps:

#### Make a graph of dependencies:

#### Find the statement of Lemma 1:

#### Determine that Lemma 1 can be proved from the axiom:

#### Show the succession of trees used in the proof of Lemma 1:

#### Visual representations of the statements on the first 10 steps:

### Visualization

### Analysis

## Bibliographic Citation

Wolfram Research,
"Proof of Wolfram's Axiom for Boolean Algebra"
from the Wolfram Data Repository
(2017) https://doi.org/10.24097/wolfram.65976.data

## Data Resource History

## Publisher Information