Geodesic
On complexity of problem of satisfiability for systems of countable-valued functional equations
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 8 (2015), pp. 25-32

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{IVM_2015_8_a2,
     author = {I. S. Kalinina and S. S. Marchenkov},
     title = {On complexity of problem of satisfiability for systems of countable-valued functional equations},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {25--32},
     publisher = {mathdoc},
     number = {8},
     year = {2015},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_2015_8_a2/}
}
TY  - JOUR
AU  - I. S. Kalinina
AU  - S. S. Marchenkov
TI  - On complexity of problem of satisfiability for systems of countable-valued functional equations
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 2015
SP  - 25
EP  - 32
IS  - 8
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_2015_8_a2/
LA  - ru
ID  - IVM_2015_8_a2
ER  - 
%0 Journal Article
%A I. S. Kalinina
%A S. S. Marchenkov
%T On complexity of problem of satisfiability for systems of countable-valued functional equations
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 2015
%P 25-32
%N 8
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_2015_8_a2/
%G ru
%F IVM_2015_8_a2
I. S. Kalinina; S. S. Marchenkov. On complexity of problem of satisfiability for systems of countable-valued functional equations. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 8 (2015), pp. 25-32. http://geodesic.mathdoc.fr/item/IVM_2015_8_a2/