scientific article; zbMATH DE number 1775542
A way to define classes of Boolean functions by certain expressions called functional terms is introduced. It is an extension of a system that uses identities, presented by \textit{O. Ekin}, \textit{S. Foldes}, \textit{P. L. Hammer} and \textit{L. Hellerstein} [Discrete Math. 211, 27-51 (2000; Zbl 0947.06008)]. Although the two schemes are equivalent in expressive power, the new approach has a number of advantages. The main results include a general characterization of term-definable classes in terms of certain closure properties. In particular, it follows that any clone of Boolean functions is term-definable. On the other hand, the family of term-definable classes is shown to be equipotent to the continuum; this is possible as infinite terrns are allowed. A class is said to have rank \(r\) if it can be defined by a term with \(r\) distinct variables. For any given natural number \(r\), the number of term-definable classes of rank \(r\) is shown to be finite, and the classes of rank 0 or 1 are completely described. Many concrete examples of term-definable classes of Boolean functions are also considered.
- Equivalent transformations of formulas in \(P_2\).
- Equational characterizations of Boolean function classes
- scientific article; zbMATH DE number 4217458
- On separation of Boolean clones by means of hyperidentities
- scientific article; zbMATH DE number 4002067
- Definability of Boolean function classes by linear equations over \(\mathbf{GF}(2)\)
- Parameter optimization of stochastic automata operating in random environments
- Asymptotic expansions for a model with distinguished “fast” and “slow” variables, described by a system of singularly perturbed stochastic differential equations
- Publication:3197877
- scientific article; zbMATH DE number 4170973
- Definability of Boolean function classes by linear equations over \(\mathbf{GF}(2)\)
- Post classes characterized by functional terms
- Separation results for Boolean function classes
- Closed classes of Boolean functions. 2nd ed.
- On equational definability of function classes
- Boolean-valued class forcing
- Term Definable Classes of Boolean Functions and Frame Definability in Modal Logic
- Join-irreducible Boolean functions
- Equational definability and a quasi-ordering on Boolean functions
- Alternative definitions of Boolean functions and relations
- On a quasi-ordering on Boolean functions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544374)
