Journal of Automated Reasoning

, Volume 19, Issue 3, pp 263–276

Solution of the Robbins Problem

  • William Mccune

DOI: 10.1023/A:1005843212881

Cite this article as:
Mccune, W. Journal of Automated Reasoning (1997) 19: 263. doi:10.1023/A:1005843212881


In this article we show that the three equations known as commutativity,associativity, and the Robbins equation are a basis for the variety ofBoolean algebras. The problem was posed by Herbert Robbins in the 1930s. Theproof was found automatically by EQP, a theorem-proving program forequational logic. We present the proof and the search strategies thatenabled the program to find the proof.

associative-commutative unificationBoolean algebraEQPequational logicparamodulationRobbins algebraRobbins problem

Copyright information

© Kluwer Academic Publishers 1997

Authors and Affiliations

  • William Mccune
    • 1
  1. 1.Mathematics and Computer Science Division, Argonne National LaboratoryArgonne