Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DM_2013_25_3_a4, author = {G. V. Bokov}, title = {Criterion for propositional calculi to be finitely generated}, journal = {Diskretnaya Matematika}, pages = {38--63}, publisher = {mathdoc}, volume = {25}, number = {3}, year = {2013}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/DM_2013_25_3_a4/} }
G. V. Bokov. Criterion for propositional calculi to be finitely generated. Diskretnaya Matematika, Tome 25 (2013) no. 3, pp. 38-63. http://geodesic.mathdoc.fr/item/DM_2013_25_3_a4/
[1] Gilbert D., Bernais P., Logicheskie ischisleniya i formalizatsiya arifmetiki, Nauka, Moskva, 1979 | MR
[2] Kolmogorov A. N., Dragalin A. G., Vvedenie v matematicheskuyu logiku, Izd-vo Mosk. un-ta, Moskva, 1982
[3] Kon P., Universalnaya algebra, Mir, Moskva, 1968 | MR
[4] Mints G. E., “Dopustimye i proizvodnye pravila”, Zapiski nauchnykh seminarov LOMI AN SSSR, 8, 1968, 189–191 | MR | Zbl
[5] Novikov P. S., Elementy matematicheskoi logiki, Nauka, Moskva, 1973 | MR | Zbl
[6] Tsitkin A. I., “O dopustimykh pravilakh intuitsionistskoi logiki vyskazyvanii”, Matem. sb., 102(144):2 (1977), 314–323 | MR | Zbl
[7] Shenfild D., Matematicheskaya logika, Nauka, Moskva, 1975 | MR
[8] Yablonskii S. V., Vvedenie v diskretnuyu matematiku, Nauka, M., 1986 | MR
[9] Yablonskii S. V., Gavrilov G. P., Kudryavtsev V. B., Funktsii algebry logiki i klassy Posta, Nauka, Moskva, 1966 | MR
[10] Yanov Yu. I., Muchnik A. A., “O suschestvovanii $k$-znachnykh zamknutykh klassov, ne imeyuschikh konechnogo bazisa”, DAN SSSR, 127:1 (1959), 44–46 | Zbl
[11] Henkin L., “Fragments of the propositional calculus”, J. Symb. Logic, 14 (1949), 42–82 | DOI | MR
[12] Post E., Two-valued iterative systems of mathematical logic, Princeton, 1941 | MR