Short Single Axioms for Boolean Algebra
@article{McCune2004ShortSA,
title={Short Single Axioms for Boolean Algebra},
author={W. McCune and R. Veroff and Branden Fitelson and Kenneth Harris and Andrew Feist and L. Wos},
journal={Journal of Automated Reasoning},
year={2004},
volume={29},
pages={1-16}
}We present short single equational axioms for Boolean algebra in terms of disjunction and negation and in terms of the Sheffer stroke. Previously known single axioms for these theories are much longer than the ones we present. We show that there is no shorter axiom in terms of the Sheffer stroke. Automated deduction techniques were used in several parts of the work.
Topics from this paper
53 Citations
A Shortest 2-Basis for Boolean Algebra in Terms of the Sheffer Stroke
- Mathematics, Computer Science
- Journal of Automated Reasoning
- 2004
- 13
- PDF
Arithmetic version of Boolean algebra
- Computer Science
- 2009 2nd IEEE International Conference on Computer Science and Information Technology
- 2009
- 1
A note on minimal axiomatisations of some extensions of MTL
- Mathematics, Computer Science
- Fuzzy Sets Syst.
- 2014
- 3
Simple characterization of functionally complete one-element sets of propositional connectives
- Mathematics, Computer Science
- Math. Log. Q.
- 2006
- 1
- PDF
References
SHOWING 1-10 OF 35 REFERENCES
A set of five independent postulates for Boolean algebras, with application to logical constants
- Mathematics
- 1913
- 169
- PDF
A fascinating country in the world of computing: your guide to automated reasoning
- Computer Science
- 1999
- 54
Searching for circles of pure proofs
- Mathematics, Computer Science
- Journal of Automated Reasoning
- 2004
- 12