Certain properties of generalized -formulas
From MaRDI portal
Recommendations
Cites work
- Complexity of realization of functions from a class of three-valued logic by formulas of special type
- Depth of -completions of systems of Boolean functions.
- Examples of α-complete systems of k-valued logic for k = 3, 4
- scientific article; zbMATH DE number 468647 (Why is no real title available?)
- On α-closed classes and α-complete Systems of k-valued logic functions
Cited in
(5)- Maximal number of Boolean functions realized by an initial Boolean automaton with two constant states
- Estimates for the number of Boolean functions realized by an initial Boolean automaton with three constant states
- scientific article; zbMATH DE number 4016976 (Why is no real title available?)
- Properties of generalized characteristic multi-valued logical functions
- On generalized Boolean functions. III. The case \(A=\{0,1\}\)
This page was built for publication: Certain properties of generalized \(\alpha\)-formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q469100)