Complexity of realization by formulas of special form for functions of multivalued logic

DOI10.3103/S0027132213010117zbMath1283.03051OpenAlexW2089642932MaRDI QIDQ355343

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/s0027132213010117

zbMATH Keywords

multivalued logiclogic functionupper exponential bound

Mathematics Subject Classification ID

Many-valued logic (03B50)

Cites Work

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

This page was built for publication: Complexity of realization by formulas of special form for functions of multivalued logic