Results 101 to 110 of about 1,728 (218)
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
Boolean algebras with no rigid or homogeneous factors
, 1982 A simple construction of Boolean algebras with no rigid or homogeneous factors is described. It is shown that for every uncountable cardinal κ \kappa there are 2 κ {2^\kappa ...
Petr Štěpánek
core +1 more source
Set-Word Embeddings and Semantic Indices: A New Contextual Model for Empirical Language Analysis
ComputersWe present a new word embedding technique in a (non-linear) metric space based on the shared membership of terms in a corpus of textual documents, where the metric is naturally defined by the Boolean algebra of all subsets of the corpus and a measure μ ...
Pedro Fernández de Córdoba +3 more
doaj +1 more source
Nonlocal Flow of Control and Kleene Algebra with Tests
, 2008 Kleene algebra with tests (KAT) is an equational system for program verification that combines Kleene algebra (KA), or the algebra of regular expressions, with Boolean algebra.
Kozen, Dexter, Dexter Kozen
core +1 more source
Weakly Dense Subsets of Homogeneous Complete Boolean Algebras [PDF]
, 1990 The primary result from this dissertation is following inequality: d(B) ≤ min(2^< wd(B),sup{λ^c(B): λ < wd(B)}) in ZFC, where B is a homogeneous complete Boolean algebra, d(B) is the density, wd(B) is the weak density, and c(B) is the cellularity of B ...
Bozeman, Alan Kyle
core
The Marczewski Hull Property and Complete Boolean Algebras
Real Analysis Exchange, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
On the injectivity of Boolean algebras [PDF]
, 1993 summary:The functor taking global elements of Boolean algebras in the topos $\text{$\bold{Sh}\frak B$}$ of sheaves on a complete Boolean algebra $\frak B$ is shown to preserve and reflect injectivity as well as completeness. This is then used to derive a
Banaschewski, B.
core
A characterization of complete atomic Boolean algebras
, 1977 In this note we give a characterization of complete atomic Boolean algebras by means of complete atomic lattices. We find that unicity of the representation of the maximum as union of atoms and Lambda-infinite distributivity law are necessary and ...
Esteva, Francisco
core
SDPs and Robust Satisfiability of Promise CSP
Discrete AnalysisSDPs and Robust Satisfiability of Promise CSP, Discrete Analysis 2025:14, 80 pp. A _constraint satisfaction problem_, or CSP, is a problem where one has a set of variables $x_1,\dots,x_n$ that live in some set, together with a collection of constraints,
Joshua Brakensiek +2 more
doaj +1 more source
Boolean algebra and switching circuits
, 1975 Includes bibliographical references (page 64)The logician, George Boole, concerned with developing a logic of mathematical symbols not dependent on quantity, devised an algebra of classes which defined adding, subtracting, multiplying, and dividing ...
Brown, Cynthia Gruber
core