Publications in Math-Net.Ru
-
Variants of Realizability for Propositional Formulas and the Logic of Weak Excluded Middle
Trudy Mat. Inst. Steklova, 242 (2003), 77–97
-
On a logical construction of the JSM-method of automated
hypothesis generation
Dokl. Akad. Nauk SSSR, 320:6 (1991), 1331–1336
-
A superintuitionistic propositional calculus
Algebra Logika, 24:2 (1985), 195–204
-
Impossibility of finite axiomatization of Medvedev's logic of finite problems
Dokl. Akad. Nauk SSSR, 245:5 (1979), 1051–1054
-
Logic of infinite problems and Kripke models on atomic semilattices of sets
Dokl. Akad. Nauk SSSR, 245:4 (1979), 798–801
-
Realizability and finite validity of propositional formulas with restrictions on the occurrence of implication
Mat. Zametki, 25:6 (1979), 919–931
-
The occurrence of an implication in finitely valid, intuitively improvable formulas of propositional logic
Mat. Zametki, 20:3 (1976), 383–390
© , 2024