Equational characterizations of Boolean function classes
The functions dealt with in this paper are truth functions \(f:\{0,1\}^n\to\{0,1\}\), viewed as functions \(f:\{0,1\}^n\to\{0,1\}^n\) such that the values of \(f\) are confined to the maximum \(\mathbf{1}=(1,\dots,1)\) and the minimum \(\mathbf{0}=(0,\dots,0)\) of \(\{0,1\}^n\). Several important classes of functions, defined in terms of their disjunctive normal forms (DNFs), are characterized by functional equations. For instance, a Horn function \(f\) is defined by the exististence of a DNF \(f=c_1\vee\cdots\vee c_m\) with the property that each elementary conjunction \(c_i\) has at most one negated variable; it is proved that a function \(f\) is Horn if and only if it satisfies the identity \(f(\mathbf{xy})\leq f({\mathbf x})\vee f({\mathbf y})\), where \(\mathbf{xy}\) is defined componentwise. More generally, a necessary condition for a class \({\mathcal K}\) to be defined by a set of identities is that \({\mathcal K}\) be closed under permutations of variables and identifications of variables. This condition is also sufficient if the class \({\mathcal K}\) is closed under addition of inessential variables. In that case \({\mathcal K}\) is characterized by a finite set of identities if and only if it is characterized by a single identity. Finally the authors study classes of functions characterized by simple existential sentences \(\exists v\forall v_1\dots\forall v_n\) \(T=Q\).
- Equivalence of operations with respect to discriminator clones
- Generalizations of Świerczkowski's lemma and the arity gap of finite functions
- On functional dependencies in q-Horn theories
- Special issue: Boolean functions and related problems
- Disjunctive and conjunctive normal forms of pseudo-Boolean functions
- Trading properties and Alexandrov kernels for Boolean functions
- Equational classes of Boolean functions via the HSP theorem
- Definability of Boolean function classes by linear equations over \(\mathbf{GF}(2)\)
- Post classes characterized by functional terms
- Disjunctive analogues of submodular and supermodular pseudo-Boolean functions
- Properties of quasi-Boolean function on quasi-Boolean algebra
- Separation results for Boolean function classes
- Characterizing Negabent Boolean Functions over Finite Fields
- On the effect of variable identification on the essential arity of functions on finite sets
- Investigation of some subclasses of multiaffine, bijunctive, weakly positive and weakly negative Boolean functions
- Variants of Essential Arity for Partial Functions
- scientific article; zbMATH DE number 5284449 (Why is no real title available?)
- scientific article; zbMATH DE number 4008464 (Why is no real title available?)
- scientific article; zbMATH DE number 4093421 (Why is no real title available?)
- The arity gap of order-preserving functions and extensions of pseudo-Boolean functions
- scientific article; zbMATH DE number 1775542 (Why is no real title available?)
- On equational definability of function classes
- On computing Boolean connectives of characteristic functions
- Additive decomposability of functions over abelian groups
- scientific article; zbMATH DE number 6973795 (Why is no real title available?)
- Content and singletons bring unique identification minors
- A complete classification of equational classes of threshold functions included in clones
- Clones with finitely many relative \({\mathcal R}\)-classes
- On the lattice of equational classes of Boolean functions and its closed intervals
- RECONSTRUCTING MULTISETS OVER COMMUTATIVE GROUPOIDS AND AFFINE FUNCTIONS OVER NONASSOCIATIVE SEMIRINGS
- scientific article; zbMATH DE number 5205533 (Why is no real title available?)
- Exact learning of DNF formulas using DNF hypotheses
- Join-irreducible Boolean functions
- The minor order of homomorphisms via natural dualities
- Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions
- Algebras, Graphs and Ordered Sets – ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet
- On the failings of Shapley values for explainability
- Equational definability and a quasi-ordering on Boolean functions
- On solutions to systems of functional equations of multiple-valued logic
- On the -equivalence of Boolean functions
- Solutions to the systems of functional equations of multivalued logic
- Reconstructing permutations from identification minors
- On complexity of problem of satisfiability for systems of countable-valued functional equations
- On a quasi-ordering on Boolean functions
- Algebraic and topological closure conditions for classes of pseudo-Boolean functions
This page was built for publication: Equational characterizations of Boolean function classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1969777)