Results 51 to 60 of about 1,844 (139)
Near-boolean algebras I: Combinatorial aspects
, 1974 An algebra =(A; ⋁, ⋀, ′, 0, 1) is near-boolean if every two generated subalgebra is a boolean algebra. It is shown that for n ⩾ 4 there is a near-boolean algebra of size n ≡ 4 or 8 (mod 12), that for n ⩾ 16 and n ≡ 4 or 8 (mod 12) there is a near-boolean
Quackenbush, Robert W. +1 more
core +1 more source
A σ-linked boolean algebra without positive measure
, 1990 We modify an example of Gaifman and obtain a boolean algebra B which has no positive measure but which is σ-linked, i.e., B⧹{0} is the union of countably many families which are linked (i.e., every two members meet)
van Douwen, Eric K.
core +1 more source
Boolean-Like Algebras of Finite Dimension: From Boolean Products to Semiring Products [PDF]
We continue the investigation, initiated in Salibra et al. (Found Sci, 2020), of Boolean-like algebras of dimension n (nBAs), algebras having n constants e1,⋯,en, and an (n+1)-ary operation q (a “generalised if-then-else”) that induces a decomposition of
Ledda, Antonio +3 more
core +1 more source
Didactical note: probabilistic conditionality in a Boolean algebra
, 1996 This note deals with two logical topics and concerns Boolean Algebras from an elementary point of view. First we consider the class of operations on a Boolean Algebra that can be used for modelling ``If-then" propositions.
Alsina Català, Claudi +4 more
core +1 more source
Counting aggregate classifiers. [PDF]
There are many methods to design classifiers for the supervised classification problem. In this paper, we study the problem of aggregating classifiers. We construct an algorithm to count the number of distinct aggregate classifiers.
Gochet, Willy +2 more
core
On the Representation of Boolean Magmas and Boolean Semilattices
, 2021 A magma is an algebra with a binary operation ·, and a Boolean magma is a Boolean algebra with an additional binary operation · that distributes over all finite Boolean joins.
Jipsen, Peter +2 more
core
A relation-algebraic approach to simple games [PDF]
Simple games are a powerful tool to analyze decision - making and coalition formation in social and political life. In this paper, we present relation-algebraic models of simple games and develop relational specifications for solving some basic problems ...
Stefan Bolus +3 more
core +2 more sources
Application of Boolean algebra to electrical switching circuit problems
, 1961 Since 1847 the time of the first published paper on mathematical logic by George Boole, Boolean algebra has grown to be a rigorous and useful part of mathematics.
Pierson, Andrew L.
core
Stone representation theorem for Boolean algebras in the topos MSet
, 2023 The famous Stone representation theorem for Boolean algebras represents them as subalgebras of the powerset Boolean algebras. In this paper, we consider a Stone type representation for Boolean algebras in the functor topos SetM, for a monoid M.
Sepahani, Sara, Mahmoudi, Mojgan
core
Implementation of a Database System with Boolean Algebra Constraints
, 1998 This thesis describes an implementation of a constraint database system with constraints over a Boolean Algebra of sets. The system allows within the input database as well as the queries equality, subset-equality and monotone inequality constraints ...
Salamon, András
core