A Shortest 2-Basis for Boolean Algebra in Terms of the Sheffer Stroke (2003)
by
Robert Veroff
| Venue: | J. Automated Reasoning |
| Citations: | 8 - 5 self |
BibTeX
@ARTICLE{Veroff03ashortest,
author = {Robert Veroff},
title = {A Shortest 2-Basis for Boolean Algebra in Terms of the Sheffer Stroke},
journal = {J. Automated Reasoning},
year = {2003},
volume = {31},
pages = {2003}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
Citations
| 388 | A new kind of science - Wolfram |
| 254 | Otter 3.0 Reference Manual and Guide - McCune - 1994 |
| 27 | Complexity and related enhancements for automated theorem-proving programs - McCharen, Overbeek, et al. - 1976 |
| 25 | Using hints to increase the effectiveness of an automated reasoning program: Case studies - Veroff - 1996 |
| 20 | Solving open questions and other challenge problems using proof sketches - Veroff |
| 18 | Short single axioms for Boolean algebra - McCune, Veroff, et al. |
| 18 | A set of five independent postulates for Boolean algebras, with application to logical constants - Sheffer - 1913 |
| 5 | Yet another single law for lattices. Algebra Universalis - McCune, Padmanabhan, et al. |
| 4 | Equational postulates for the Sheffer stroke - Meredith - 1969 |
| 3 | A legacy recalled and a tradition continued - Ulrich |
| 3 | Correspondence by electronic mail - Wolfram - 2000 |
