Equational definability and a quasi-ordering on Boolean functions
نویسندگان
چکیده
Earlier work by several authors has focused on defining Boolean function classes by means of functional equations. In [10], it was shown that the classes of Boolean functions definable by functional equations coincide with initial segments of the quasi-ordered set (Ω,≤) made of the set Ω of Boolean functions, suitably quasi-ordered. Furthermore, the classes defined by finitely many equations coincide with the initial segments of (Ω,≤) which are definable by finitely many obstructions. The resulting ordered set (Ω/ ≡,v) embeds into ([ω]<ω ,⊆), the set -ordered by inclusionof finite subsets of the set ω of integers. But the converse also holds. We define an order-embedding of ([ω]<ω,⊆) into (Ω/ ≡,v ). From this result, we deduce that the dual space of the distributive lattice made of finitely definable classes is uncountable. Looking at examples of finitely definable classes, we consider classes of Boolean functions with a bounded number of essential variables and classes of functions with bounded polynomial degree. We provide concrete equational characterizations of these classes, as well as of the subclasses made of linear functions with a bounded number of essential variables. Moreover, we present descriptions of the classes of functions with bounded polynomial degree in terms of minimal obstructions.
منابع مشابه
Dually quasi-De Morgan Stone semi-Heyting algebras II. Regularity
This paper is the second of a two part series. In this Part, we prove, using the description of simples obtained in Part I, that the variety $mathbf{RDQDStSH_1}$ of regular dually quasi-De Morgan Stone semi-Heyting algebras of level 1 is the join of the variety generated by the twenty 3-element $mathbf{RDQDStSH_1}$-chains and the variety of dually quasi-De Morgan Boolean semi-Heyting algebras--...
متن کاملDually quasi-De Morgan Stone semi-Heyting algebras I. Regularity
This paper is the first of a two part series. In this paper, we first prove that the variety of dually quasi-De Morgan Stone semi-Heyting algebras of level 1 satisfies the strongly blended $lor$-De Morgan law introduced in cite{Sa12}. Then, using this result and the results of cite{Sa12}, we prove our main result which gives an explicit description of simple algebras(=subdirectly irreducibles) ...
متن کاملOn a quasi-ordering on Boolean functions
It was proved few years ago that classes of Boolean functions definable by means of functional equations [9], or equivalently, by means of relational constraints [15], coincide with initial segments of the quasi-ordered set (Ω,≤) made of the set Ω of Boolean functions, suitably quasi-ordered. The resulting ordered set (Ω/ ≡,⊑) embeds into ([ω] ,⊆), the set -ordered by inclusionof finite subsets...
متن کاملHanf Locality and Invariant Elementary Definability
We introduce some notions of invariant elementary definability which extend the notions of first-order order-invariant definability, and, more generally, definability invariant with respect to arbitrary numerical relations. In particular, we study invariance with respect to expansions which depend not only on (an ordering of) the universe of a structure, but also on the particular relations whi...
متن کاملFunctional Equations, Constraints, Definability of Function Classes, and Functions of Boolean Variables
The paper deals with classes of functions of several variables defined on an arbitrary set A and taking values in a possibly different set B. Definability of function classes by functional equations is shown to be equivalent to definability by relational constraints, generalizing a fact established by Pippenger in the case A = B = {0, 1}. Conditions for a class of functions to be definable by c...
متن کامل