Complexity of realization of functions from a class of three-valued logic by formulas of special type

DOI10.3103/S0027132212040043zbMath1283.03050OpenAlexW2067356427MaRDI QIDQ355253

D. V. Trushchin

Publication date: 24 July 2013

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

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

zbMATH Keywords

exponential lower boundsthree-valued logicShannon functionlogic functions

Mathematics Subject Classification ID

Many-valued logic (03B50)

Related Items (2)

Complexity of realization by formulas of special form for functions of multivalued logic ⋮ Certain properties of generalized \(\alpha\)-formulas

Cites Work

• 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
• Unnamed Item

This page was built for publication: Complexity of realization of functions from a class of three-valued logic by formulas of special type