Partial Boolean algebras in a broader sense and Boolean embeddings
Janusz Czelakowski (1981)
Colloquium Mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Janusz Czelakowski (1981)
Colloquium Mathematicae
Similarity:
Brian Wynne (2008)
Fundamenta Mathematicae
Similarity:
Two Boolean algebras are elementarily equivalent if and only if they satisfy the same first-order statements in the language of Boolean algebras. We prove that every Boolean algebra is elementarily equivalent to the algebra of clopen subsets of a normal P-space.
Slobodan Vujošević (1989)
Publications de l'Institut Mathématique
Similarity:
Martin Gavalec (1981)
Colloquium Mathematicae
Similarity:
Steven Garavaglia, J. M. Plotkin (1984)
Colloquium Mathematicae
Similarity:
Banković, Dragić (1998)
Novi Sad Journal of Mathematics
Similarity:
D. Banković (1987)
Matematički Vesnik
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].
Wroński, Stanisław (2015-10-26T10:14:52Z)
Acta Universitatis Lodziensis. Folia Mathematica
Similarity:
Robert Lagrange (1974)
Colloquium Mathematicae
Similarity:
Roman Sikorski (1961)
Colloquium Mathematicum
Similarity: