|
Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2015, Number 8, Pages 25–32
(Mi ivm9025)
|
|
|
|
On complexity of problem of satisfiability for systems of countable-valued functional equations
I. S. Kalinina, S. S. Marchenkov Chair of Mathematical Cybernetics, Moscow State University, 1 Leninskie Gory, Bld. 52, GSP-1, Moscow, 119991 Russia
Abstract:
We consider the problem of satisfiability for systems of countable-valued functional equations, containing ternary discriminator function $p$. We prove that this problem is $m$-complete in the class $\Pi_1$ of Kleene–Mostovsky's hierarchy.
Keywords:
functional equations, countable-valued logic, problem of satisfiability.
Received: 06.06.2014
Citation:
I. S. Kalinina, S. S. Marchenkov, “On complexity of problem of satisfiability for systems of countable-valued functional equations”, Izv. Vyssh. Uchebn. Zaved. Mat., 2015, no. 8, 25–32; Russian Math. (Iz. VUZ), 59:8 (2015), 19–24
Linking options:
https://www.mathnet.ru/eng/ivm9025 https://www.mathnet.ru/eng/ivm/y2015/i8/p25
|
|