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