On cheating immune secret sharing.
On collections of almost disjoint families
On equations in bounded lattices.
On extending of partial Boolean algebras to partial *-algebras
On extension properties for observables
On fields and ideals connected with notions of forcing
We investigate an algebraic notion of decidability which allows a uniform investigation of a large class of notions of forcing. Among other things, we show how to build σ-fields of sets connected with Laver and Miller notions of forcing and we show that these σ-fields are closed under the Suslin operation.
On free Boolean vectors.
On general and reproductive solutions of finite equations.
On generalized derivations of partially ordered sets
Let be a poset and be a derivation on . In this research, the notion of generalized -derivation on partially ordered sets is presented and studied. Several characterization theorems on generalized -derivations are introduced. The properties of the fixed points based on the generalized -derivations are examined. The properties of ideals and operations related with generalized -derivations are studied.
On hereditary interval algebras.
On hidden variables
On linear operators strongly preserving invariants of Boolean matrices
Let be the general Boolean algebra and a linear operator on . If for any in (, respectively), is regular (invertible, respectively) if and only if is regular (invertible, respectively), then is said to strongly preserve regular (invertible, respectively) matrices. In this paper, we will give complete characterizations of the linear operators that strongly preserve regular (invertible, respectively) matrices over . Meanwhile, noting that a general Boolean algebra is isomorphic...
On Marczewski-Burstin representable algebras
We construct algebras of sets which are not MB-representable. The existence of such algebras was previously known under additional set-theoretic assumptions. On the other hand, we prove that every Boolean algebra is isomorphic to an MB-representable algebra of sets.
On maximal QROBDD’s of boolean functions
We investigate the structure of “worst-case” quasi reduced ordered decision diagrams and Boolean functions whose truth tables are associated to: we suggest different ways to count and enumerate them. We, then, introduce a notion of complexity which leads to the concept of “hard” Boolean functions as functions whose QROBDD are “worst-case” ones. So we exhibit the relation between hard functions and the Storage Access function (also known as Multiplexer).
On maximal QROBDD's of Boolean functions
We investigate the structure of “worst-case” quasi reduced ordered decision diagrams and Boolean functions whose truth tables are associated to: we suggest different ways to count and enumerate them. We, then, introduce a notion of complexity which leads to the concept of “hard” Boolean functions as functions whose QROBDD are “worst-case” ones. So we exhibit the relation between hard functions and the Storage Access function (also known as Multiplexer).
On maximal submonoids of BX.
On minimal dynamical systems on Boolean algebras
On minimal separating Boolean algebras.
On minimal spectrum of multiplication lattice modules
We study the minimal prime elements of multiplication lattice module over a -lattice . Moreover, we topologize the spectrum of minimal prime elements of and study several properties of it. The compactness of is characterized in several ways. Also, we investigate the interplay between the topological properties of and algebraic properties of .
On Monk’s questions
We deal with Boolean algebras and their cardinal functions: π-weight π and π-character πχ. We investigate the spectrum of π-weights of subalgebras of a Boolean algebra B. Next we show that the π-character of an ultraproduct of Boolean algebras may be different from the ultraproduct of the π-characters of the factors.