|
|
Publications in Math-Net.Ru
-
A formal reduction of the general problem of the expressibility of formulas in the Gödel-Löb provability logic
Diskr. Mat., 14:2 (2002), 95–106
-
On some properties of systems, complete with respect to expressibility, of formulas in the Gödel–Löb provability logic
Diskr. Mat., 12:4 (2000), 63–82
-
Unsolvability of the problem of functional expressibility in the modal logic $\mathrm{S}4$
Dokl. Akad. Nauk SSSR, 268:4 (1983), 814–817
-
Nontabularity of the logic ${\rm S}4$ with respect to
functional completeness
Algebra Logika, 21:3 (1982), 283–320
-
A criterion for functional completeness in classical first-order predicate logic
Dokl. Akad. Nauk SSSR, 249:3 (1979), 540–544
-
A criterion for functional completeness in the intuitionistic propositional logic
Dokl. Akad. Nauk SSSR, 201:4 (1971), 794–797
-
A test for functional completeness in the logic corresponding to Jaskowski’s first matrix
Dokl. Akad. Nauk SSSR, 168:3 (1966), 524–527
-
Aleksandr Vladimirovich Kuznetsov (obituary)
Uspekhi Mat. Nauk, 41:2(248) (1986), 179–180
-
Поправки к статье “Критерий функциональной полноты в интуционистской логике высказываний”
(ДАН, т. 201, № 4, 1971 г.)
Dokl. Akad. Nauk SSSR, 206:6 (1972), 775
© , 2024