Hostname: page-component-cb9f654ff-pvkqz Total loading time: 0 Render date: 2025-08-24T21:34:38.605Z Has data issue: false hasContentIssue false
  • English
  • Français

Postulates for Boolean Algebras

Published online by Cambridge University Press:  20 November 2018

Marlow Sholander
Marlow Sholander*
Affiliation:
Washington University
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The independence of postulates for well-known systems is a question of general interest. A closely related question is whether or not, by altering one or more of the postulates in an independent set, the set remains independent. From this standpoint the best sets of postulates are those which involve, first, the fewest postulates and, next, the least number of variables. As a rule progress is made in this direction at the sacrifice of simplicity of postulates. In this paper, in counting postulates, we ignore properties such as closure under the operations and count only identities or those stating that one equation implies another.

Information

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 5 , 1953 , pp. 460 - 464
Copyright
Copyright © Canadian Mathematical Society 1953

References

1. Bernstein, B. A., Simplification of the set of four postulates for Boolean algebras in terms of rejection, Bull. Amer. Math. Soc, 39 (1933), 783–787.Google Scholar
2. Bernstein, B. A., A set of four postulates for Boolean algebra in terms of the “implicative” operation, Trans. Amer. Math. Soc, 36 (1934), 876–884.Google Scholar
3. Bernstein, B. A., Postulate-sets for Boolean rings, Trans. Amer. Math. Soc,55 (1944), 393–400.Google Scholar
4. Birkhoff, Garrett, Lattice theory, 2nd ed. (New York, 1948).Google Scholar
5. Byrne, Lee, Two brief formulations of Boolean algebra, Bull. Amer. Math. Soc, 52(1946), 269–272.Google Scholar
6. Byrne, Lee, Short formulations of Boolean algebra using ring operations, Can. J. Math., 3 (1951), 31–33.Google Scholar
7. Croisot, R., Axiomatique des lattices distributives, Can. J. Math., 3 (1951), 24–27.Google Scholar
8. Diamond, A. H. and McKinsey, J. C. C., Algebras and their subalgebras, Bull. Amer. Math. Soc, 53 (1947), 959–962.Google Scholar
9. Hoberman, S. and McKinsey, J. C. C., A set of postulates for Boolean algebra, Bull. Amer. Math. Soc, 43 (1937), 588–592.Google Scholar
10. Huntington, E. V., New sets of independent postulates for the algebra of logic, Trans. Amer. Math. Soc, 35 (1933), 274–304 with corrections 557 and 971.Google Scholar
11. Sholander, Marlow, Postulates for distributive lattices, Can. J. Math., 3 (1951), 28–30.Google Scholar