Related papers: On composition-closed classes of Boolean functions
A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have…
The class of Hausdorff spaces that are continuous images of compact orderable spaces is studied by analyzing the relationship between the elements of this class and compact orderable spaces in a back-and-forth fashion. Structure results for…
We prove that there is a lattice embedded from every countable distributive lattice into the Boolean algebra of computable subsets of $\mathbb{N}$. Along the way, we discuss all relevant results about lattices, Boolean algebras and…
We consider lattices of regular sets of non negative integers, i.e. of sets definable in Presbuger arithmetic. We prove that if such a lattice is closed under decrement then it is also closed under many other functions: quotients by an…
Every partial algebra is the colimit of its total subalgebras. We prove this result for partial Boolean algebras (including orthomodular lattices) and the new notion of partial C*-algebras (including noncommutative C*-algebras), and…
J. S. Wilson proved in 1971 an isomorphism between the structural lattice associated to a group belonging to his second class of groups with every proper quotient finite and the Boolean algebra of clopen subsets of Cantor's ternary set. In…
We investigate classes of Boolean algebras related to the notion of forcing that adds Cohen reals. A >>Cohen algebra<< is a Boolean algebra that is dense in the completion of a free Boolean algebra. We introduce and study generalizations of…
This paper explores the interplay between category theory, topology, and the algebraic theory of finite groups. Our analysis unfolds in three stages. First, we establish the foundational universe of our objects: the complete and cocomplete…
A class of bilinear permutation polynomials over a finite field of characteristic 2 was constructed in a recursive manner recently which involved some other constructions as special cases. We determine the compositional inverses of them…
We use the structure lattice, introduced in Part I, to undertake a systematic study of the class $\mathscr S$ consisting of compactly generated, topologically simple, totally disconnected locally compact groups that are non-discrete. Given…
A clone on a set X is a set of finitary functions on X which contains the projections and which is closed under composition. The set of all clones on X forms a complete algebraic lattice Cl(X). We obtain several results on the structure of…
J{\'o}nsson and Tarski's notion of the perfect extension of a Boolean algebra with operators has evolved into an extensive theory of canonical extensions of lattice-based algebras. After reviewing this evolution we make two contributions.…
Inspired by prior work of Bruinier and Ono and Mertens and Rolen, we study class polynomials for non-holomorphic modular functions arising from modular forms of negative weight. In particular, we give general conditions for the…
Boolean calculus has been studied extensively in the past in the context of switching circuits, error-correcting codes etc. This work generalizes several approaches to defining a differential calculus for Boolean functions. A unified theory…
We determine the dimension of every simple module for the algebra of the monoid of all relations on a finite set (i.e. Boolean matrices). This is in fact the same question as the determination of the dimension of every evaluation of a…
Whenever the defining sequence of a Carleman ultraholomorphic class (in the sense of H. Komatsu) is strongly regular and associated with a proximate order, flat functions are constructed in the class on sectors of optimal opening. As…
We give a general notion of combinatory completeness with respect to a faithful cartesian club and use it systematically to obtain characterisations of a number of different kinds of applicative system. Each faithful cartesian club…
Determining the approximate degree composition for Boolean functions remains a significant unsolved problem in Boolean function complexity. In recent decades, researchers have concentrated on proving that approximate degree composes for…
Monotone Boolean functions, and the monotone Boolean circuits that compute them, have been intensively studied in complexity theory. In this paper we study the structure of Boolean functions in terms of the minimum number of negations in…
We describe a class calculus that is expressive enough to describe and improve its own learning process. It can design and debug programs that satisfy given input/output constraints, based on its ontology of previously learned programs. It…