Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T06:02:33.326Z Has data issue: false hasContentIssue false

Postulates for Boolean Algebras

Published online by Cambridge University Press:  20 November 2018

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
Copyright
Copyright © Canadian Mathematical Society 1953