scientific article; zbMATH DE number 51303
zbMATH Open0744.06007MaRDI QIDQ4001697FDOQ4001697
Authors: A. B. Ugol'nikov, S. S. Marchenkov
Publication date: 18 September 1992
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 1544631
- Post classes characterized by functional terms
- Existence of finite bases in closed classes of Boolean functions
- Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes
- scientific article; zbMATH DE number 4214083
functional completenessbasisBoolean functionmajority functionstruth functionsclosed classBoolean relationPost diagram
Boolean functions (06E30) Logical aspects of Boolean algebras (03G05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to ordered structures (06-01) Research exposition (monographs, survey articles) pertaining to ordered structures (06-02)
Cited In (32)
- Title not available (Why is that?)
- Description of all classes of superfunctions consisting of disjunctions
- Title not available (Why is that?)
- On classes of superfunctions on two-element set
- The completeness and closed classes of functions of Boolean algebra with direct and iterative variables
- Title not available (Why is that?)
- Title not available (Why is that?)
- Composition of Post classes and normal forms of Boolean functions
- A class of functions from \(P_2\)
- Boolean equations and Post classes
- Title not available (Why is that?)
- Closed classes of ultimately periodic functions
- On the number of Boolean functions in the Post classes F μ 8
- Title not available (Why is that?)
- New iterative chain classes of pseudo-Boolean functions
- Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes
- Title not available (Why is that?)
- Existence of finite bases in closed classes of Boolean functions
- On a metric characteristic of implicit and parametric representations of Boolean functions
- Inductive representations of Boolean functions and the finite generation of the Post classes
- Title not available (Why is that?)
- Equivalent transformations of formulas in \(P_2\).
- Post classes characterized by functional terms
- On composition-closed classes of Boolean functions
- Functionally complete sets of Boolean functions and Post's lattice
- Compositions and clones of Boolean functions
- Set-reconstructibility of Post classes
- Generalized analytic functions
- Closed classes of Boolean functions. 2nd ed.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
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 Q4001697)