On a quasi-ordering on Boolean functions
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
It was proved few years ago that classes of Boolean functions definable by means of functional equations \cite{EFHH}, or equivalently, by means of relational constraints \cite{Pi2}, coincide with initial segments of the quasi-ordered set $(Ω, \leq)$ made of the set $Ω$ of Boolean functions, suitably quasi-ordered. The resulting ordered set $(Ω/\equiv, \sqsubseteq)$ embeds into $([ω]^{<ω}, \subseteq)$, the set -ordered by inclusion- of finite subsets of the set $ω$ of integers. We prove that $(Ω/\equiv, \sqsubseteq)$ also embeds $([ω]^{<ω}, \subseteq)$. We prove that initial segments of $(Ω, \leq)$ which are definable by finitely many obstructions coincide with classes defined by finitely many equations. This gives, in particular, that the classes of Boolean functions with a bounded number of essential variables are finitely definable. As an example, we provide a concrete characterization of the subclasses made of linear functions.
14 pages
14 pages