Hostname: page-component-cd9895bd7-dzt6s Total loading time: 0 Render date: 2024-12-23T06:27:38.902Z Has data issue: false hasContentIssue false
  • English
  • Français

A Self-Dual Equational Basis for Boolean Algebras

Published online by Cambridge University Press:  20 November 2018

R. Padmanabhan
R. Padmanabhan*
Affiliation:
University of Manitoba, Winnipeg, Manitoba, Canada R3T 2N2
Rights & Permissions [Opens in a new window]

Abstract

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 principle of duality for Boolean algebra states that if an identity ƒ = g is valid in every Boolean algebra and if we transform ƒ = g into a new identity by interchanging (i) the two lattice operations and (ii) the two lattice bound elements 0 and 1, then the resulting identity ƒ = g is also valid in every Boolean algebra. Also, the equational theory of Boolean algebras is finitely based. Believing in the cosmic order of mathematics, it is only natural to ask whether the equational theory of Boolean algebras can be generated by a finite irredundant set of identities which is already closed for the duality mapping. Here we provide one such equational basis.

Keywords

03G0506E99Boolean algebrasduality principleminimal self-dual equational basistypes of algebras
Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 26 , Issue 1 , 01 March 1983 , pp. 9 - 12
Copyright
Copyright © Canadian Mathematical Society 1983

References

1. Berstein, B. A., A dual-symmetric definition of Boolean algebra, Scripta Mathematica 16 (1950), 157-160.Google Scholar
2. Grätzer, G., Lattice theory: first concepts and distributive lattices, W. H. Freeman & Co., San Francisco, 1971.Google Scholar
3. Montague, R. and Tarski, J., On Bernstein's self-dual set of postulates for Boolean algebras, Proc. Amer. Math. Soc. 5 (1954), 310-311.Google Scholar
4. Padmanabhan, R., On axioms for semilattices, Canad. Math. Bull, 9 (1966), 357-358.Google Scholar
5. Rudeanu, S., Axioms for lattices and Boolean algebras (in Roumanian), Bucharest, 1963.Google Scholar
6. Sioson, F. M., Equational bases for Boolean algebras, J. Symbolic Logic 29 (1964), 115-124.Google Scholar