Geodesic
Complexity of the problem of expressibility in many-valued logics
Doklady Akademii Nauk, Tome 282 (1985) no. 3, pp. 525-529.

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

@article{DAN_1985_282_3_a2,
     author = {N. R. Emel'yanov},
     title = {Complexity of the problem of expressibility in many-valued logics},
     journal = {Doklady Akademii Nauk},
     pages = {525--529},
     publisher = {mathdoc},
     volume = {282},
     number = {3},
     year = {1985},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1985_282_3_a2/}
}
TY  - JOUR
AU  - N. R. Emel'yanov
TI  - Complexity of the problem of expressibility in many-valued logics
JO  - Doklady Akademii Nauk
PY  - 1985
SP  - 525
EP  - 529
VL  - 282
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1985_282_3_a2/
LA  - ru
ID  - DAN_1985_282_3_a2
ER  - 
%0 Journal Article
%A N. R. Emel'yanov
%T Complexity of the problem of expressibility in many-valued logics
%J Doklady Akademii Nauk
%D 1985
%P 525-529
%V 282
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1985_282_3_a2/
%G ru
%F DAN_1985_282_3_a2
N. R. Emel'yanov. Complexity of the problem of expressibility in many-valued logics. Doklady Akademii Nauk, Tome 282 (1985) no. 3, pp. 525-529. http://geodesic.mathdoc.fr/item/DAN_1985_282_3_a2/