Results 191 to 200 of about 5,885 (231)
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Robbins algebra: Conditions that make a near-boolean algebra boolean
Journal of Automated Reasoning, 1990Some problems posed years ago remain challenging today. In particular, the Robbins problem, which is still open and which is the focus of attention in this paper, offers interesting challenges for attack with the assistance of an automated reasoning program; for the study presented here, we used the program OTTER.
exaly +2 more sources
Canadian Journal of Mathematics, 1971 A Boolean algebra B is a retract of an algebra A if there exist homomorphisms ƒ: B → A and g: A → B such that gƒ is the identity map B. Some important properties of retracts of Boolean algebras are stated in [3, §§ 30, 31, 32]. If A and B are a-complete, and A is α-generated by B, Dwinger [1, p.
Timothy Cramer
openaire +2 more sources
IEEE Transactions on Computers, 1980
Switching algebra is unable to represent the dynamic behavior of digital circuits. There are several known methods for modeling the dynamics of circuits, using either multivalued algebras or specialized operators. None of them preserves the framework of switching algebra; therefore, existing analysis and synthesis methods developed by switching theory ...
Sany Leinwand, T. Lamdan
openaire +1 more source
Switching algebra is unable to represent the dynamic behavior of digital circuits. There are several known methods for modeling the dynamics of circuits, using either multivalued algebras or specialized operators. None of them preserves the framework of switching algebra; therefore, existing analysis and synthesis methods developed by switching theory ...
Sany Leinwand, T. Lamdan
openaire +1 more source
Order, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uri Abraham +3 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uri Abraham +3 more
openaire +1 more source
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 +1 more source
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 +1 more source
Mathematical Logic Quarterly, 1992
AbstractIn this paper we investigate Boolean algebras and their subalgebras in Alternative Set Theory (AST). We show that any two countable atomless Boolean algebras are isomorphic and we give an example of such a Boolean algebra. One other main result is, that there is an infinite Boolean algebra freely generated by a set.
openaire +1 more source
AbstractIn this paper we investigate Boolean algebras and their subalgebras in Alternative Set Theory (AST). We show that any two countable atomless Boolean algebras are isomorphic and we give an example of such a Boolean algebra. One other main result is, that there is an infinite Boolean algebra freely generated by a set.
openaire +1 more source
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
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
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