Beljakin Nikolay Vasil'evich

Publications in Math-Net.Ru

1. Intensionality, reflection, and large cardinals
   
   Sibirsk. Mat. Zh., 43:6 (2002),  1222–1234
2. Infinite arithmetical formulas and the reflection principle
   
   Algebra Logika, 36:3 (1997),  245–258
3. Pulsating hierarchies
   
   Sibirsk. Mat. Zh., 35:3 (1994),  520–526
4. Nonstandard analysis and the axiom of determinacy
   
   Algebra Logika, 32:6 (1993),  607–617
5. Effective hierarchies
   
   Algebra Logika, 29:4 (1990),  385–397
6. Calculations with oracles: a generalized selection
   
   Sibirsk. Mat. Zh., 31:4 (1990),  192–196
7. Computations with oracles
   
   Trudy Inst. Mat. Sib. Otd. AN SSSR, 12 (1989),  4–24
8. Iterated Kleene computability
   
   Sibirsk. Mat. Zh., 30:6 (1989),  26–41
9. A means of modeling the classical second-order arithmetic
   
   Algebra Logika, 22:1 (1983),  3–25
10. Autonomous computability
    
    Algebra Logika, 18:4 (1979),  398–407
11. Iterated Kleene computability and the superjump
    
    Mat. Sb. (N.S.), 101(143):1(9) (1976),  21–43
12. Generalized computations, and third order arithmetic
    
    Algebra Logika, 13:2 (1974),  132–144
13. Generalized computations over regular numerations
    
    Algebra Logika, 12:6 (1973),  623–643
14. A certain class of recursive hierarchies
    
    Algebra Logika, 12:1 (1973),  3–21
15. Generalized computations
    
    Trudy Mat. Inst. Steklov., 133 (1973),  59–64
16. Generalized computations and second order arithmetic
    
    Algebra Logika, 9:4 (1970),  375–405
17. A variant of Richter's constructive ordinals
    
    Algebra Logika, 8:2 (1969),  154–171
18. A complete arithmetical system
    
    Algebra i Logika. Sem., 6:2 (1967),  5–11
19. The completeness of an arithmetic
    
    Dokl. Akad. Nauk SSSR, 175:5 (1967),  975–977
20. Turing machines working in the plane
    
    Dokl. Akad. Nauk SSSR, 168:3 (1966),  502–503
21. The calculation of effective operators on Turing machines with restricted erasure
    
    Algebra i Logika. Sem., 2:1 (1963),  19–23
22. Distribution of intermediate information when computing on non-erasing Turing machines
    
    Dokl. Akad. Nauk SSSR, 152:1 (1963),  75–77
23. On a class of Turing machines
    
    Dokl. Akad. Nauk SSSR, 148:1 (1963),  47–49