A selection theorem for Boolean correspondences.
Siegfried Graf (1977)
Journal für die reine und angewandte Mathematik
Similarity:
Siegfried Graf (1977)
Journal für die reine und angewandte Mathematik
Similarity:
Paul D. Bacsich (1972)
Journal für die reine und angewandte Mathematik
Similarity:
Tabuev, S.N. (2003)
Vladikavkazskiĭ Matematicheskiĭ Zhurnal
Similarity:
Roman Sikorski (1963)
Colloquium Mathematicae
Similarity:
Francesc Esteva (1977)
Stochastica
Similarity:
In this note we give a characterization of complete atomic Boolean algebras by means of complete atomic lattices. We find that unicity of the representation of the maximum as union of atoms and Lambda-infinite distributivity law are necessary and sufficient conditions for the lattice to be a complete atomic Boolean algebra.
P. Ribenboin (1969)
Fundamenta Mathematicae
Similarity:
William Hanf (1976)
Fundamenta Mathematicae
Similarity:
Steven Garavaglia, J. M. Plotkin (1984)
Colloquium Mathematicae
Similarity:
D. Banković (1987)
Matematički Vesnik
Similarity:
Wroński, Stanisław (2015-10-26T10:14:52Z)
Acta Universitatis Lodziensis. Folia Mathematica
Similarity:
Sergiu Rudeanu (2001)
Kragujevac Journal of Mathematics
Similarity:
A. Hales (1964)
Fundamenta Mathematicae
Similarity:
Sergiu Rudeanu (1998)
Mathware and Soft Computing
Similarity:
An abstract form of modus ponens in a Boolean algebra was suggested in [1]. In this paper we use the general theory of Boolean equations (see e.g. [2]) to obtain a further generalization. For a similar research on Boolean deduction theorems see [3].