Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Plisko, Valerii Egorovich
Statistics Math-Net.Ru
Total publications: 23
Scientific articles: 22
Presentations: 1

Number of views:
This page:1858
Abstract pages:5891
Full texts:2743
References:510
Associate professor
Candidate of physico-mathematical sciences (1974)
E-mail:
Website: https://lpcs.math.msu.su/~plisko/

https://www.mathnet.ru/eng/person19543
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/190413

Publications in Math-Net.Ru Citations
2023
1. V. E. Plisko, “The nonarithmeticity of the predicate logic of primitive recursive realizability”, Izv. RAN. Ser. Mat., 87:2 (2023),  196–228  mathnet  mathscinet; Izv. Math., 87:2 (2023), 389–419  isi  scopus
2017
2. V. E. Plisko, “Constructive theory of enumerable species”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2017, no. 2,  13–19  mathnet  mathscinet; Moscow University Mathematics Bulletin, 72:2 (2017), 55–60  isi  scopus
2015
3. A. Yu. Konovalov, V. E. Plisko, “On Hyperarithmetical Realizability”, Mat. Zametki, 98:5 (2015),  725–746  mathnet  mathscinet  elib; Math. Notes, 98:5 (2015), 778–797  isi  scopus 12
2011
4. Valerii E. Plisko, “A survey of predicate realizability logic”, Trudy Mat. Inst. Steklova, 274 (2011),  222–251  mathnet  mathscinet  elib; Proc. Steklov Inst. Math., 274 (2011), 204–230  isi  elib  scopus 1
2006
5. V. E. Plisko, “A relation between two notions of primitive recursive realizability”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2006, no. 1,  6–11  mathnet  mathscinet  zmath 1
2002
6. V. E. Plisko, “The elements of the constructive model theory”, Fundam. Prikl. Mat., 8:3 (2002),  783–828  mathnet  mathscinet  zmath 1
1999
7. V. E. Plisko, “On arithmetic complexity of the predicate logics of complete constructive arithmetic theories”, Fundam. Prikl. Mat., 5:1 (1999),  221–255  mathnet  mathscinet  zmath 2
1997
8. V. E. Plisko, “Modified realizability and predicate logic”, Mat. Zametki, 61:2 (1997),  259–269  mathnet  mathscinet  zmath; Math. Notes, 61:2 (1997), 212–220  isi 2
1993
9. V. E. Plisko, “On logics that have diagnostic formulas relative to a minimal calculus”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1993, no. 6,  18–22  mathnet  mathscinet  zmath
1992
10. V. E. Plisko, “On arithmetic complexity of certain constructive logics”, Mat. Zametki, 52:1 (1992),  94–104  mathnet  mathscinet  zmath; Math. Notes, 52:1 (1992), 701–709  isi 5
11. V. E. Plisko, “On the concept of relatively uniform realizability of propositional formulas”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1992, no. 2,  77–79  mathnet  mathscinet  zmath
1991
12. V. E. Plisko, “On the relationship between some concepts of constructive model theory”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1991, no. 4,  38–41  mathnet  mathscinet  zmath 2
13. V. A. Uspenskii, V. E. Plisko, “Diagnostic propositional formulas”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1991, no. 3,  7–12  mathnet  mathscinet  zmath
1990
14. V. E. Plisko, “Constructive formalization of the Tennenbaum theorem and its applications”, Mat. Zametki, 48:3 (1990),  108–118  mathnet  mathscinet  zmath; Math. Notes, 48:3 (1990), 950–957  isi 6
1988
15. V. E. Plisko, “The Kolmogorov calculus as a part of minimal calculus”, Uspekhi Mat. Nauk, 43:6(264) (1988),  79–91  mathnet  mathscinet  zmath; Russian Math. Surveys, 43:6 (1988), 95–110 4
1987
16. V. E. Plisko, “Languages with constructive logical connectives”, Dokl. Akad. Nauk SSSR, 296:1 (1987),  35–38  mathnet  mathscinet  zmath; Dokl. Math., 36:2 (1988), 236–239 3
1983
17. V. E. Plisko, “Absolute realizability of predicate formulas”, Izv. Akad. Nauk SSSR Ser. Mat., 47:2 (1983),  315–334  mathnet  mathscinet  zmath; Math. USSR-Izv., 22:2 (1984), 291–308 22
1978
18. V. E. Plisko, “Some variants of the notion of realizability for predicate formulas”, Izv. Akad. Nauk SSSR Ser. Mat., 42:3 (1978),  636–653  mathnet  mathscinet  zmath; Math. USSR-Izv., 12:3 (1978), 588–604 8
1977
19. V. E. Plisko, “The nonarithmeticity of the class of realizable predicate formulas”, Izv. Akad. Nauk SSSR Ser. Mat., 41:3 (1977),  483–502  mathnet  mathscinet  zmath; Math. USSR-Izv., 11:3 (1977), 453–471 17
1976
20. V. E. Plisko, “Some variants of the notion of realizability for predicate formulas”, Dokl. Akad. Nauk SSSR, 226:1 (1976),  61–64  mathnet  mathscinet  zmath 3
1974
21. V. E. Plisko, “Recursive realizability and constructive predicate logic”, Dokl. Akad. Nauk SSSR, 214:3 (1974),  520–523  mathnet  mathscinet  zmath 5
1973
22. V. E. Plisko, “Realizable predicate formulae”, Dokl. Akad. Nauk SSSR, 212:3 (1973),  553–556  mathnet  mathscinet  zmath 6
1989
23. V. E. Plisko, “Errata”, Uspekhi Mat. Nauk, 44:3(267) (1989),  205  mathnet  mathscinet; Russian Math. Surveys, 44:3 (1989), 232  isi

Presentations in Math-Net.Ru
1. Constructive interpretations of logical and logical-mathematical languages
Valeri Plisko
Workshop "Semantical and Computational Aspects of Non-Classical Logics" (SCAN 2023)
June 13, 2023 10:00   

Organisations
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024