Kuznetsov Aleksandr Vladimirovich

Publications in Math-Net.Ru

1. The proof-intuitionistic propositional calculus
   
   Dokl. Akad. Nauk SSSR, 283:1 (1985),  27–30
2. A criterion for functional completeness in classical first-order predicate logic
   
   Dokl. Akad. Nauk SSSR, 249:3 (1979),  540–544
3. The finitely axiomatizable superintuitionistic logics
   
   Dokl. Akad. Nauk SSSR, 195:6 (1970),  1263–1266
4. The superintuitionistic logics and finitary approximability
   
   Dokl. Akad. Nauk SSSR, 195:5 (1970),  1029–1032
5. Analogs of the “Sheffer stroke” in constructive logic
   
   Dokl. Akad. Nauk SSSR, 160:2 (1965),  274–277
6. Undecidability of the general problems of completeness, solvability and equivalence for propositional calculi
   
   Algebra i Logika. Sem., 2:4 (1963),  47–66
7. Non-repeating contact schemes and non-repeating superpositions of functions of algebra of logic
   
   Trudy Mat. Inst. Steklov., 51 (1958),  186–225
8. A property of functions realized by non-planar non-repeating networks
   
   Trudy Mat. Inst. Steklov., 51 (1958),  174–185


9. Поправки к статье “О конечно аксиоматизируемых суперинтуиционистских логиках” (ДАН, т. 195, № 6, 1970 г.)
   
   Dokl. Akad. Nauk SSSR, 199:6 (1971),  742
10. Поправки к статье “О суперинтуиционистских логиках и финитной аппроксимируемости” (ДАН, т. 195, № 5, 1970 г.)
    
    Dokl. Akad. Nauk SSSR, 199:6 (1971),  742