Results 201 to 210 of about 5,885 (231)
Some of the next articles are maybe not open access.
Mathematics of the USSR-Sbornik, 1973
The paper contains the construction of a general theory of Boolean-valued algebras: There are introduced the notions of a homeomorphism, congruence, subalgebra and direct product. It is shown that these algebras possess properties that are totally analogous to the properties of two-valued algebras.
openaire +2 more sources
The paper contains the construction of a general theory of Boolean-valued algebras: There are introduced the notions of a homeomorphism, congruence, subalgebra and direct product. It is shown that these algebras possess properties that are totally analogous to the properties of two-valued algebras.
openaire +2 more sources
On the Representation of Boolean Algebras
Canadian Mathematical Bulletin, 1962Let 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.
openaire +2 more sources
HYPERIDENTITIES OF BOOLEAN ALGEBRAS
Russian Academy of Sciences. Izvestiya Mathematics, 1993See the review in Zbl 0773.08003.
openaire +1 more source
A Representation for Boolean Algebras
American Journal of Mathematics, 19511. The content. The success of Stone [5] in representing Boolean algebras by fields of sets leads one to search for other representations. (See also [2, p. 159], [4].) Using splitting endomorphisms on a type of Abelian group with an order relation, we are led to a faithful representation of a given Boolean algebra B. The group employed will be called a
openaire +2 more sources
Hierarchies of Boolean algebras
Journal of Symbolic Logic, 1970A denumerable structure is said to be recursive iff its universe is a recursive subset of the natural numbers and its relations and operations are recursive. For example, the standard model of number theory is recursive. A structure is said to be recursively presentable iff it is isomorphic to a recursive structure.
openaire +1 more source
Parallel Processing in Boolean Algebra
IEEE Transactions on Computers, 1972A processor called Boolean analyzer has been presented at the 1968 IFIP Congress to introduce parallel processing of Boolean expressions [1]. The present paper shows how to increase its speed many times by making its processing more parallel. The applications of the Boolean analyzer are limited to few but important problems.
openaire +1 more source
Postulates for Boolean Algebras and Generalized Boolean Algebras
American Journal of Mathematics, 1935openaire +1 more source
A Characterization of Boolean Algebras
The Annals of Mathematics, 1939Birkhoff, Garrett, Ward, Morgan
openaire +2 more sources

