A Shortest 2-Basis for Boolean Algebra in Terms of the Sheffer Stroke

  • Authors:

  • Robert Veroff

  • Affiliations:

  • University of New Mexico, Albuquerque, NM 87131, USA

  • Venue:
  • Journal of Automated Reasoning
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this article, we present a short 2-basis for Boolean algebra in terms of the Sheffer stroke and prove that no such 2-basis can be shorter. We also prove that the new 2-basis is unique (for its length) up to applications of commutativity. Our proof of the 2-basis was found by using the method of proof sketches and relied on the use of an automated reasoning program.