Results 141 to 150 of about 3,079 (232)

Prime ideal theorem for double Boolean algebras

, 2007
Double Boolean algebras are algebras (D,⊓,⊔,⊲,⊳,⊥,⊤) of type (2,2,1,1,0,0). They have been introduced to capture the equational theory of the algebra of protoconcepts. A filter (resp. an ideal) of a double Boolean algebra D is an upper set F (resp.
Kwuida, Léonard
core   +1 more source

Non-Kolmogorovian Probabilities and Quantum Technologies. [PDF]

Entropy (Basel), 2022
Holik FH.
europepmc   +1 more source

Relation algebras /

, 2006
The modern theory of algebras of binary relations, reformulated by Tarski as an abstract, algebraic, equational theory of relation algebras, has considerable mathematical significance, with applications in various fields: e.g., in computer science ...
Maddux, R. D.(Roger D.),
core  

The Measurement Problem Is a Feature, Not a Bug-Schematising the Observer and the Concept of an Open System on an Informational, or (Neo-)Bohrian, Approach. [PDF]

Entropy (Basel), 2023
Cuffaro ME.
europepmc   +1 more source

Systems of Precision: Coherent Probabilities on Pre-Dynkin Systems and Coherent Previsions on Linear Subspaces. [PDF]

Entropy (Basel), 2023
Derr R, Williamson RC.
europepmc   +1 more source

Quantum Boolean Algebras

, 2010
We introduce quantum Boolean algebras which are the analogue of the Weyl algebras for Boolean affine spaces. We study quantum Boolean algebras from the logical and set theoretical viewpoints.
openaire   +3 more sources

Verifiable biology. [PDF]

J R Soc Interface, 2023
Konur S, Gheorghe M, Krasnogor N.
europepmc   +1 more source

POLYADIC BOOLEAN ALGEBRAS [PDF]

Proceedings of the National Academy of Sciences, 1954
openaire   +2 more sources

Vector Lattices in Boolean Algebras

, 2008
The theory of Boolean algebras has been used extensively to study aspects of the theory of vector lattices. In this talk, we show how, in turn, the theory of vector lattices can be applied to study Boolean algebras. In particular, we will present a proof
Buskes, Gerard
core  

Dense subtrees in complete Boolean algebras

, 2008
We characterize complete Boolean algebras with dense subtrees. The main results show that a complete Boolean algebra contains a dense tree if its generic filter collapses the algebra’s density to its distributivity number and the reverse holds for ...
Bernhard König
core