Results 101 to 110 of about 26,374 (144)

Optimizing regional innovation ecosystems through actor-environment coevolution: A dynamic configurational analysis from a CAS perspective. [PDF]

PLoS One
Pang H, Jiang Y, Wu L, Wang L.
europepmc   +1 more source

Developing a cognitive model of solid geometry based on Interpretive Structural Modeling method. [PDF]

Heliyon
Zhang H, Wu X, Ju M.
europepmc   +1 more source

Developing a high-performing network computation of big bipartite network data toward alcohol use disorder treatment referrals. [PDF]

Proc IEEE Int Conf Semant Comput
Amith MT, Andrews S, Heads A, Kluwe-Schiavon B, Choday A, Poonam R, Ballem SV, Tao C, Hamilton J.   +8 more
europepmc   +1 more source

An Extended Epistemic Framework Beyond Probability for Quantum Information Processing with Applications in Security, Artificial Intelligence, and Financial Computing. [PDF]

Entropy (Basel)
Iovane G.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Skew Boolean algebras derived from generalized Boolean algebras

Algebra universalis, 2008
Every skew Boolean algebra S has a maximal generalized Boolean algebra image given by S/\({\mathcal{D}}\) where \({\mathcal{D}}\) is the Green’s relation defined initially on semigroups. In this paper we study skew Boolean algebras \(\omega({\bf B})\) constructed from generalized Boolean algebras B by a twisted product construction for which \(\omega({\
Jonathan Leech, Matthew Spinks
openaire   +1 more source

Minimally generated Boolean algebras

Order, 1989
A Boolean algebra is minimally generated iff it is the union of a continuous well-ordered chain of subalgebras, where each \(B_{\alpha +1}\) is minimally generated over \(B_{\alpha}\). This paper proves basic theorems about minimally generated algebras. For example: Theorem. Interval algebras and superatomic algebras are minimally generated.
openaire   +1 more source

Generalized Boolean Algebras in Lattice-Ordered Groups

Order, 1997
In this paper lattice-ordered groups and lattice-ordered modules generated by a generalized Boolean algebra (i.e., relatively complemented distributive lattice) are investigated and (complete) extensions of \(l\)-groups based on generalized Boolean algebras are studied. The main results deal with Specker \(l\)-groups, i.e., \(l\)-groups \(G\) which are
Conrad, Paul F., Darnel, Michael R.
openaire   +1 more source

Continuum cardinals generalized to Boolean algebras

Journal of Symbolic Logic, 2001
A number of specific cardinal numbers have been defined in terms of /fin or ωω. Some have been generalized to higher cardinals, and some even to arbitrary Boolean algebras. Here we study eight of these cardinals, defining their generalizations to higher cardinals, and then defining them for Boolean algebras. We then attempt to completely describe their
openaire   +1 more source

Generalized Boolean Algebras and Applications

2018
A new notion of a lattice valued Boolean algebra is introduced. It is based on an algebra with two binary, a unary and two nullary operations, which is not a crisp Boolean algebra in general. The classical equality is replaced by a lattice valued equivalence so that the Boolean algebra identities are correspondingly satisfied.
O. S. A. Bleblou, B. Šešelja, A. Tepavčević   +2 more
openaire   +1 more source