Plisko Valerii Egorovich

Publications in Math-Net.Ru

1. A Constructive Predicate Calculus
   
   Mat. Zametki, 118:2 (2025),  278–298
2. The nonarithmeticity of the predicate logic of primitive recursive realizability
   
   Izv. RAN. Ser. Mat., 87:2 (2023),  196–228
3. Constructive theory of enumerable species
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2017, no. 2,  13–19
4. On Hyperarithmetical Realizability
   
   Mat. Zametki, 98:5 (2015),  725–746
5. A survey of predicate realizability logic
   
   Trudy Mat. Inst. Steklova, 274 (2011),  222–251
6. A relation between two notions of primitive recursive realizability
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2006, no. 1,  6–11
7. The elements of the constructive model theory
   
   Fundam. Prikl. Mat., 8:3 (2002),  783–828
8. On arithmetic complexity of the predicate logics of complete constructive arithmetic theories
   
   Fundam. Prikl. Mat., 5:1 (1999),  221–255
9. Modified realizability and predicate logic
   
   Mat. Zametki, 61:2 (1997),  259–269
10. On logics that have diagnostic formulas relative to a minimal calculus
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1993, no. 6,  18–22
11. On arithmetic complexity of certain constructive logics
    
    Mat. Zametki, 52:1 (1992),  94–104
12. On the concept of relatively uniform realizability of propositional formulas
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1992, no. 2,  77–79
13. On the relationship between some concepts of constructive model theory
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1991, no. 4,  38–41
14. Diagnostic propositional formulas
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1991, no. 3,  7–12
15. Constructive formalization of the Tennenbaum theorem and its applications
    
    Mat. Zametki, 48:3 (1990),  108–118
16. The Kolmogorov calculus as a part of minimal calculus
    
    Uspekhi Mat. Nauk, 43:6(264) (1988),  79–91
17. Languages with constructive logical connectives
    
    Dokl. Akad. Nauk SSSR, 296:1 (1987),  35–38
18. Absolute realizability of predicate formulas
    
    Izv. Akad. Nauk SSSR Ser. Mat., 47:2 (1983),  315–334
19. Some variants of the notion of realizability for predicate formulas
    
    Izv. Akad. Nauk SSSR Ser. Mat., 42:3 (1978),  636–653
20. The nonarithmeticity of the class of realizable predicate formulas
    
    Izv. Akad. Nauk SSSR Ser. Mat., 41:3 (1977),  483–502
21. Some variants of the notion of realizability for predicate formulas
    
    Dokl. Akad. Nauk SSSR, 226:1 (1976),  61–64
22. Recursive realizability and constructive predicate logic
    
    Dokl. Akad. Nauk SSSR, 214:3 (1974),  520–523
23. Realizable predicate formulae
    
    Dokl. Akad. Nauk SSSR, 212:3 (1973),  553–556


24. Errata
    
    Uspekhi Mat. Nauk, 44:3(267) (1989),  205