Certain properties of generalized \(\alpha\)-formulas

DOI10.3103/S0027132213040098zbMath1298.03076OpenAlexW2075271071MaRDI QIDQ469100

Lyubov' Nikolaevna Sysoeva

Publication date: 10 November 2014

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0027132213040098

Mathematics Subject Classification ID

Boolean functions (06E30) Many-valued logic (03B50)

Related Items (2)

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

Cites Work

• Unnamed Item
• Complexity of realization of functions from a class of three-valued logic by formulas of special type
• Depth of \(\alpha\)-completions of systems of Boolean functions.
• Examples of α-complete systems of k-valued logic for k = 3, 4
• On α-closed classes and α-complete Systems of k-valued logic functions

This page was built for publication: Certain properties of generalized \(\alpha\)-formulas