Sciweavers

178 search results - page 2 / 36
» Boolean Algebras in Visser Algebras
Sort
View
DAM
2008
125views more  DAM 2008»
13 years 5 months ago
Heyting algebras with Boolean operators for rough sets and information retrieval applications
This paper presents an algebraic formalism for reasoning on finite increasing sequences over Boolean algebras in general and on generalizations of Rough Set concepts in particular...
Eric SanJuan
TIT
2008
130views more  TIT 2008»
13 years 4 months ago
Improving the Lower Bound on the Higher Order Nonlinearity of Boolean Functions With Prescribed Algebraic Immunity
Abstract. The recent algebraic attacks have received a lot of attention in cryptographic literature. The algebraic immunity of a Boolean function quantifies its resistance to the s...
Sihem Mesnager
ADBIS
2004
Springer
193views Database» more  ADBIS 2004»
13 years 8 months ago
Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
Peter Z. Revesz
JSYML
2008
112views more  JSYML 2008»
13 years 4 months ago
On the structure of the Medvedev lattice
We investigate the structure of the Medvedev lattice as a partial order. We prove that every interval in the lattice is either finite, in which case it is isomorphic to a finite B...
Sebastiaan Terwijn
CALCO
2005
Springer
76views Mathematics» more  CALCO 2005»
13 years 10 months ago
Strong Splitting Bisimulation Equivalence
We present ACPc , a process algebra with conditional expressions in which the conditions are taken from a Boolean algebra, and extensions of this process algebra with mechanisms fo...
Jan A. Bergstra, C. A. Middelburg