scientific article

zbMATH Open0618.03006MaRDI QIDQ3754598FDOQ3754598

N. R. Emel'yanov

Publication date: 1985

Title of this publication is not available (Why is that?)

zbMATH Keywords

function system

Mathematics Subject Classification ID

Many-valued logic (03B50) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (6)

• Extending the reach of SAT with many-valued logics
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the expressibility hierarchy of Magidor-Malitz quantifiers
• Proof search and co-NP completeness for many-valued logics
• On expressibility of functions of many-valued logic in some logical-functional languages

   Recommendations

• Title not available (Why is that?) 👍 👎
• One approach to construction of effective algorithms for recognizing completeness in multivalued logics 👍 👎
• Complexity of realization by formulas of special form for functions of multivalued logic 👍 👎
• Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication:

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