A selection theorem for Boolean correspondences.
Siegfried Graf (1977)
Journal für die reine und angewandte Mathematik
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A solution of Dedekind's problem on the number of isotone Boolean functions.”
A selection theorem for Boolean correspondences.
Extension of Boolean homomorphisms with bounding semimorphisms.
Paul D. Bacsich (1972)
Journal für die reine und angewandte Mathematik
Similarity:
Expansion of an atomic operator.
Tabuev, S.N. (2003)
Vladikavkazskiĭ Matematicheskiĭ Zhurnal
Similarity:
On dense subsets of Boolean algebras
Roman Sikorski (1963)
Colloquium Mathematicae
Similarity:
A characterization of complete atomic Boolean algebra.
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.
Boolean powers
P. Ribenboin (1969)
Fundamenta Mathematicae
Similarity:
Representing real numbers in denumerable Boolean algebras
William Hanf (1976)
Fundamenta Mathematicae
Similarity:
Separation properties and Boolean powers
Steven Garavaglia, J. M. Plotkin (1984)
Colloquium Mathematicae
Similarity:
Notes on unique solutions of boolean equations
D. Banković (1987)
Matematički Vesnik
Similarity:
On proper subuniverses of a boolean algebra
Wroński, Stanisław (2015-10-26T10:14:52Z)
Acta Universitatis Lodziensis. Folia Mathematica
Similarity:
On Boolean partial differential equations
Sergiu Rudeanu (2001)
Kragujevac Journal of Mathematics
Similarity:
On the non-existence of free complete Boolean algebras
A. Hales (1964)
Fundamenta Mathematicae
Similarity:
On Boolean modus ponens.
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].