Orevkov Vladimir Pavlovich

Publications in Math-Net.Ru

1. Upper and lower bounds on the height of proofs in sequent calculus for intuitionistic logic
   
   Zap. Nauchn. Sem. POMI, 497 (2020),  124–169
2. Cut for resolution method
   
   Zap. Nauchn. Sem. POMI, 407 (2012),  111–128
3. A new decidable Horn fragment of the predicate calculus
   
   Zap. Nauchn. Sem. POMI, 316 (2004),  147–162
4. A note on a extension of Kreisel's conjecture
   
   Zap. Nauchn. Sem. LOMI, 176 (1989),  118–126
5. Schemes of proof in Hilbert-type axiomatic theories
   
   Zap. Nauchn. Sem. LOMI, 174 (1988),  132–146
6. Applications of cut elimination for obtaining bounds on the lengths of proofs
   
   Dokl. Akad. Nauk SSSR, 296:3 (1987),  539–542
7. Lower bounds for the lengths of deductions in arithmetic in terms of the complexity of the terms involved in the deductions
   
   Dokl. Akad. Nauk SSSR, 294:4 (1987),  784–787
8. Reconstruction of a proof by its scheme
   
   Dokl. Akad. Nauk SSSR, 293:2 (1987),  313–316
9. Upper bounds for lengthening of proofs after cut-elimination
   
   Zap. Nauchn. Sem. LOMI, 137 (1984),  87–98
10. Three ways of recognizing essential formulas in sequents
    
    Zap. Nauchn. Sem. LOMI, 88 (1979),  163–175
11. Lower bounds for lengthening of proofs after cut-elimination
    
    Zap. Nauchn. Sem. LOMI, 88 (1979),  137–162
12. Solvable classes of pseudoprenex formulas
    
    Zap. Nauchn. Sem. LOMI, 60 (1976),  109–170
13. New proof of the uniqueness theorem for the differentiable complex-variable functions
    
    Zap. Nauchn. Sem. LOMI, 40 (1974),  119–126
14. The complexity of the expansion of algebraic irrationalities in continued fractions
    
    Trudy Mat. Inst. Steklov., 129 (1973),  24–29
15. Undecidable classes of formulas for the constructive predicate calculus. I
    
    Trudy Mat. Inst. Steklov., 121 (1972),  100–108
16. Decidable classes that reduce to a single quantifier class
    
    Trudy Mat. Inst. Steklov., 121 (1972),  57–66
17. A specialization of Gentzen-type deductions and its application
    
    Zap. Nauchn. Sem. LOMI, 32 (1972),  98–104
18. On biconjunctive reduction classes
    
    Zap. Nauchn. Sem. LOMI, 20 (1971),  170–174
19. On the continuity of constructive functionals
    
    Zap. Nauchn. Sem. LOMI, 20 (1971),  160–169
20. The equivalence of the two definitions of recursive continuity
    
    Zap. Nauchn. Sem. LOMI, 20 (1971),  145–159
21. Some properties of homeomorphisms of constructive metric spaces
    
    Zap. Nauchn. Sem. LOMI, 16 (1969),  157–164
22. On non-lengthening applications of equality rules
    
    Zap. Nauchn. Sem. LOMI, 16 (1969),  152–156
23. A computer algorithm for establishing deducibility, based on the inverse method
    
    Zap. Nauchn. Sem. LOMI, 16 (1969),  8–19
24. On Glivenko sequent classes
    
    Trudy Mat. Inst. Steklov., 98 (1968),  131–154
25. Two unsolvable classes of formulas of classical predicate calculus
    
    Zap. Nauchn. Sem. LOMI, 8 (1968),  202–210
26. Glivenko classes of sequents
    
    Zap. Nauchn. Sem. LOMI, 8 (1968),  196–201
27. On certain types of continuity of constructive operators
    
    Trudy Mat. Inst. Steklov., 93 (1967),  164–186
28. On constructive mappings of finite polyhedra
    
    Trudy Mat. Inst. Steklov., 93 (1967),  142–163
29. Unsolvability in the modal predicate calculus of the class of formulas containing only one monadic predicate variable
    
    Zap. Nauchn. Sem. LOMI, 4 (1967),  168–173
30. On embedding operations
    
    Zap. Nauchn. Sem. LOMI, 4 (1967),  160–167
31. Unsolvability in constructive predicate calculus of a class of formulas of type $\daleth\daleth\forall\exists$
    
    Dokl. Akad. Nauk SSSR, 163:3 (1965),  581–583
32. Insolvability in the constructive calculus of predicates of certain classes of formulae containing only one-place predicate variables
    
    Dokl. Akad. Nauk SSSR, 163:2 (1965),  295–297
33. Certain reduction classes and solvable classes of sequents for the constructive calculus of predicates
    
    Dokl. Akad. Nauk SSSR, 163:1 (1965),  30–32
34. Certain questions of the theory of polynomials with constructive real coefficients
    
    Trudy Mat. Inst. Steklov., 72 (1964),  462–487
35. On constructive mappings of a circle into itself
    
    Trudy Mat. Inst. Steklov., 72 (1964),  437–461
36. A generalization of the theorems of V. I. Glivenko and G. Kreisel to a class of formulae of the predicate calculus
    
    Dokl. Akad. Nauk SSSR, 152:3 (1963),  553–554
37. Constructive mappings of polyhedra
    
    Dokl. Akad. Nauk SSSR, 152:2 (1963),  278–281
38. A constructive map of the square into itself, which moves every constructive point
    
    Dokl. Akad. Nauk SSSR, 152:1 (1963),  55–58


39. Gregory Samuilovich Tseytin (obituary)
    
    Uspekhi Mat. Nauk, 78:3(471) (2023),  170–176
40. Nikolai Aleksandrovich Shanin (obituary)
    
    Uspekhi Mat. Nauk, 68:4(412) (2013),  173–176
41. Nikolai Aleksandrovich Shanin (on his 80th birthday)
    
    Uspekhi Mat. Nauk, 56:3(339) (2001),  181–184
42. Nikolai Aleksandrovich Shanin (on his seventieth birthday)
    
    Uspekhi Mat. Nauk, 45:1(271) (1990),  205–206
43. Sergei Yur'evich Maslov (obituary)
    
    Uspekhi Mat. Nauk, 39:2(236) (1984),  129–130
44. Nikolai Aleksandrovich Shanin (on his sixtieth birthday)
    
    Uspekhi Mat. Nauk, 35:2(212) (1980),  241–245
45. Editorial
    
    Trudy Mat. Inst. Steklov., 121 (1972),  4
46. Preface
    
    Trudy Mat. Inst. Steklov., 98 (1968),  3–4