Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-20T11:46:03.576Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Representation of Boolean Algebras

Published online by Cambridge University Press:  20 November 2018

Günter Bruns
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.

Let B be a Boolean algebra and let ℳ and n be two systems of subsets of B, both containing all finite subsets of B. Let us assume further that the join ∨M of every set M∊ℳ and the meet ∧N of every set N∊n exist. Several authors have treated the question under which conditions there exists an isomorphism φ between B and a field δ of sets, satisfying the conditions:

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 5 , Issue 1 , January 1962 , pp. 37 - 41
Copyright
Copyright © Canadian Mathematical Society 1962

References

1 We denote by "∨, ∧" the lattice theoretical operations, by "∪, ∩" the corresponding set theoretical operations.

2 See Sikorski, Boolean algebras, Berlin-G?ttingen-Heidelberg 1960, pp. 79 ff and the literature cited there.

3 See Sikorski, loc. cit. p. 93, D).

4 See Sikorski, loc. cit., p. 80, 24. 1.