On complexity of problem of satisfiability for systems of countable-valued functional equations

DOI10.3103/S1066369X15080034zbMath1337.39006OpenAlexW2271046677MaRDI QIDQ905075

I. S. Kalinina, Sergey S. Marchenkov

Publication date: 14 January 2016

Published in: Russian Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

system of functional equationscountable-valued logicKleene-Mostowski arithmetical hierarchyproblem of satisfiability

Mathematics Subject Classification ID

Functional equations for complex functions (39B32) Systems of functional equations and inequalities (39B72)

Cites Work

• The FE-closure operator in countable-valued logic
• On solutions to systems of functional equations of multiple-valued logic
• Solutions to the systems of functional equations of multivalued logic
• Galois theory for minors of finite functions
• FE classification of functions of many-valued logic
• Equational classes of Boolean functions via the HSP theorem
• Equational characterizations of Boolean function classes
• Definability in the language of functional equations of a countable-valued logic
• The ternary discriminator function in universal algebra
• On the complexity of the satisfiability problem for a system of functional Boolean equations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On complexity of problem of satisfiability for systems of countable-valued functional equations