# Wolfram Data Repository

Immediate Computable Access to Curated Contributed Data

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.

In[1]:= |

Out[1]= |

In[2]:= |

Out[2]= |

In[3]:= |

Out[3]= |

In[4]:= |

Out[4]= |

In[5]:= |

Out[5]= |

In[6]:= |

Out[6]= |

In[7]:= |

Out[7]= |

In[8]:= |

Out[8]= |

In[9]:= |

Out[9]= |

In[10]:= |

Out[10]= |

In[11]:= |

Out[11]= |

In[12]:= |

Out[12]= |

In[13]:= |

Out[13]= |

In[14]:= |

Out[14]= |

In[15]:= |

Out[15]= |

In[16]:= |

Out[16]= |

In[17]:= |

Out[17]= |

In[18]:= |

Out[18]= |

In[19]:= |

Out[19]= |

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