Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DA_2006_13_3_a4, author = {N. G. Parvatov}, title = {A completeness theorem in the class of quasimonotonic functions}, journal = {Diskretnyj analiz i issledovanie operacij}, pages = {62--82}, publisher = {mathdoc}, volume = {13}, number = {3}, year = {2006}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/DA_2006_13_3_a4/} }
N. G. Parvatov. A completeness theorem in the class of quasimonotonic functions. Diskretnyj analiz i issledovanie operacij, Tome 13 (2006) no. 3, pp. 62-82. http://geodesic.mathdoc.fr/item/DA_2006_13_3_a4/
[1] Agibalov G. P., Diskretnye avtomaty na polureshetkakh, Izd-vo Tomckogo un-ta, Tomsk, 1993 | Zbl
[2] Birkgof G., Teoriya reshetok, Nauka, M., 1984 | MR
[3] Bodnarchuk V. G., Kaluzhnin L. A., Kotov V. N., Romov B. A., “Teoriya Galua dlya algebr Posta”, Kibernetika, 1969, no. 3, 1–10 ; No 5, 1–9 | MR | Zbl
[4] Kostrikin A. I., Vvedenie v algebru. Chast III. Osnovnye struktury algebry, Uchebnik dlya vuzov, Fiziko-matematicheskaya literatura, M., 2001
[5] Parvatov N. G., “Funktsionalnaya polnota v zamknutykh klassakh kvazimonotonnykh i monotonnykh trekhznachnykh funktsii na polureshetke”, Diskret. analiz i issled. operatsii. Ser 1, 10:1 (2003), 61–73 | MR
[6] Yablonskii S. V., “Funktsionalnye postroeniya v $k$-znachnoi logike”, Sb. statei po matematicheskoi logike i nekotorym voprosam kibernetiki, Trudy Matematicheskogo in-ta im. V. A. Steklova, 51, Izd-vo AN SSSR, M., 1958, 5–142
[7] Shennon K., “Sintez dvukhpolyusnykh pereklyuchatelnykh skhem”, Raboty po teorii informatsii i kibernetike, Izd-vo inostrannoi literatury, 1963, 59–105