The paper is in two parts. In Part I we describe a construction of a certain kind of subdirect product of a family of rings. We endow the index set of the family with the partial order structure of an SFP domain, as introduced by Plotkin, and provide a commuting system of homomorphisms between those rings whose indices are related in the ordering. We then take the subdirect product consisting o...

We generalize to universal algebra concepts originating from lambda calculus and programming in order first to prove a new result on the lattice of λ-theories, and second a general theorem of pure universal algebra which can be seen as a meta version of the Stone Representation Theorem. The interest of a systematic study of the lattice λT of λ-theories grows out of several open problems on lamb...

we show  that a projective maximal submodule of afinitely generated, regular, extending module is a directsummand. hence, every finitely generated, regular, extendingmodule with projective maximal submodules is semisimple. as aconsequence, we observe that every regular, hereditary, extendingmodule is semisimple. this generalizes and simplifies a result of  dung and   smith. as another consequen...

The design of Boolean functions with properties of cryptographic significance is a hard task. In this paper, we adopt an unorthodox approach to the design of such functions. Our search space is the set of functions that possess the required properties. It is ‘Booleanness’ that is evolved.

Systems Biology is quickly becoming a major focus of applied and computational mathematics research. While traditionally numerics and continuous modeling techniques have been used, in recent years it has become apparent that qualitative modeling, data quantization and data mining questions play a central role for the field. Monotone Boolean functions are ubiquitous in these models, and, surpris...