Results 181 to 190 of about 176,338 (220)
Some of the next articles are maybe not open access.
Order, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uri Abraham +3 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uri Abraham +3 more
openaire +2 more sources
Algebraic partial Boolean algebras
Journal of Physics A: Mathematical and General, 2003Partial Boolean algebras are algebraic in this paper in the sense that their elements have coordinates in an algebraic number field. Within this context the author shows that every algebraic finitely-generated partial Boolean algebra is finite when the underlying space is three-dimensional.
openaire +2 more sources
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
Postulates for Boolean Algebras
Canadian Journal of Mathematics, 1953The independence of postulates for well-known systems is a question of general interest. A closely related question is whether or not, by altering one or more of the postulates in an independent set, the set remains independent.
openaire +2 more sources
Journal of Symbolic Logic, 2000
Feiner [F] showed that a Boolean algebra need not have a computable copy (see also [T2]). Downey and Jockusch [D-J] showed that every low Boolean algebra does have a computable copy. Thurber [T3], showed that every low2 Boolean algebra has a computable copy. Here we show that every Boolean algebra which is low3, or even low4, has a computable copy.The
Julia F. Knight, Michael Stob
openaire +2 more sources
Feiner [F] showed that a Boolean algebra need not have a computable copy (see also [T2]). Downey and Jockusch [D-J] showed that every low Boolean algebra does have a computable copy. Thurber [T3], showed that every low2 Boolean algebra has a computable copy. Here we show that every Boolean algebra which is low3, or even low4, has a computable copy.The
Julia F. Knight, Michael Stob
openaire +2 more sources
Acta Mathematica Sinica, English Series, 2004
Let \(X\) be a Banach space. The classical Orlicz-Pettis theorem says that weak subseries convergence already implies subseries convergence. The authors use the term \(P(\mathbb N)\) is \(X\)-weakly summing to express that the conclusion of the Orlicz-Pettis theorem holds in \(X\) when subseries corresponding to all subsets of \(\mathbb N\) are ...
Aizpuru, Antonio +1 more
openaire +2 more sources
Let \(X\) be a Banach space. The classical Orlicz-Pettis theorem says that weak subseries convergence already implies subseries convergence. The authors use the term \(P(\mathbb N)\) is \(X\)-weakly summing to express that the conclusion of the Orlicz-Pettis theorem holds in \(X\) when subseries corresponding to all subsets of \(\mathbb N\) are ...
Aizpuru, Antonio +1 more
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
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