The completeness to within coding of systems of functions of a $k$-valued logic and the complexity of its recognition
Doklady Akademii Nauk, Tome 180 (1968) no. 4, pp. 803-805
Cet article a éte moissonné depuis la source Math-Net.Ru
@article{DAN_1968_180_4_a8,
author = {R. V. Freivald},
title = {The completeness to within coding of systems of functions of a $k$-valued logic and the complexity of its recognition},
journal = {Doklady Akademii Nauk},
pages = {803--805},
year = {1968},
volume = {180},
number = {4},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DAN_1968_180_4_a8/}
}
TY - JOUR AU - R. V. Freivald TI - The completeness to within coding of systems of functions of a $k$-valued logic and the complexity of its recognition JO - Doklady Akademii Nauk PY - 1968 SP - 803 EP - 805 VL - 180 IS - 4 UR - http://geodesic.mathdoc.fr/item/DAN_1968_180_4_a8/ LA - ru ID - DAN_1968_180_4_a8 ER -
R. V. Freivald. The completeness to within coding of systems of functions of a $k$-valued logic and the complexity of its recognition. Doklady Akademii Nauk, Tome 180 (1968) no. 4, pp. 803-805. http://geodesic.mathdoc.fr/item/DAN_1968_180_4_a8/