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

DOI10.3103/S0027132212040043zbMATH Open1283.03050OpenAlexW2067356427MaRDI QIDQ355253FDOQ355253

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

Recommendations

• Complexity of functions from some classes of three-valued logic
• Complexity of realization by formulas of special form for functions of multivalued logic
• Behavior of the Shannon function for some families of classes of three-valued logic functions
• scientific article
• Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases

zbMATH Keywords

Shannon functionthree-valued logicexponential lower boundslogic functions

Mathematics Subject Classification ID

Many-valued logic (03B50)

Cites Work

• Depth of \(\alpha\)-completions of systems of Boolean functions.
• Title not available (Why is that?)
• Examples of α-complete systems of k-valued logic for k = 3, 4
• On α-closed classes and α-complete Systems of k-valued logic functions

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Certain properties of generalized \(\alpha\)-formulas
• Three types of function perturbations of mix-valued logical networks with impacts on limit sets
• Complexity of realization by formulas of special form for functions of multivalued logic
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q355253)