On complexity of problem of satisfiability for systems of countable-valued functional equations
DOI10.3103/S1066369X15080034zbMATH Open1337.39006OpenAlexW2271046677MaRDI QIDQ905075FDOQ905075
Authors: I. S. Kalinina, S. 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
Recommendations
- On the complexity of solutions of systems of functional equations in countable-valued logic
- On the complexity of the satisfiability problem for a system of functional Boolean equations
- scientific article; zbMATH DE number 1943080
- On solutions to systems of automata-type functional equations
- Complexity of generalized satisfiability counting problems
system of functional equationscountable-valued logicKleene-Mostowski arithmetical hierarchyproblem of satisfiability
Functional equations for complex functions (39B32) Systems of functional equations and inequalities (39B72)
Cites Work
- FE classification of functions of many-valued logic
- The closure operator in a multi-valued logic based on functional equations
- On classifications of many-valued logic functions by means of automorphism groups
- Title not available (Why is that?)
- The FE-closure operator in countable-valued logic
- On the complexity of the satisfiability problem for a system of functional Boolean equations
- On solutions to systems of functional equations of multiple-valued logic
- Solutions to the systems of functional equations of multivalued logic
- The ternary discriminator function in universal algebra
- Galois theory for minors of finite functions
- Title not available (Why is that?)
- Equational characterizations of Boolean function classes
- Equational classes of Boolean functions via the HSP theorem
- Definability in the language of functional equations of a countable-valued logic
Cited In (6)
- Functional equations for the functions of real variables
- On the complexity of the satisfiability problem for a system of functional Boolean equations
- Title not available (Why is that?)
- On the complexity of solutions of systems of functional equations in countable-valued logic
- On solutions to systems of automata-type functional equations
- On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations
This page was built for publication: On complexity of problem of satisfiability for systems of countable-valued functional equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q905075)
