Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Polyakov, E A

Statistics Math-Net.Ru
Total publications: 19
Scientific articles: 19

Number of views:
This page:654
Abstract pages:3045
Full texts:1486
References:195

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

Publications in Math-Net.Ru Citations
2007
1. E. A. Polyakov, “Description of the Endomorphisms of the Algebra of Arithmetic Functions with the Operations of Addition and Superposition”, Mat. Zametki, 82:6 (2007),  891–893  mathnet  mathscinet  zmath  elib; Math. Notes, 82:6 (2007), 803–805  isi  scopus
2005
2. E. A. Polyakov, “On $R$-Universal Functions”, Mat. Zametki, 78:2 (2005),  259–264  mathnet  mathscinet  zmath  elib; Math. Notes, 78:2 (2005), 234–238  isi  scopus
2003
3. E. A. Polyakov, A. E. Perov, “$F_\rho$ Functions”, Mat. Zametki, 74:4 (2003),  559–563  mathnet  mathscinet  zmath; Math. Notes, 74:4 (2003), 530–533  isi  scopus 1
2001
4. E. A. Polyakov, “On resemblance and recursive isomorphism types of partial recursive functions”, Sibirsk. Mat. Zh., 42:1 (2001),  149–152  mathnet  mathscinet  zmath; Siberian Math. J., 42:1 (2001), 131–133  isi
1998
5. E. A. Polyakov, “Minimal $m$-powers”, Mat. Zametki, 63:5 (1998),  795–797  mathnet  mathscinet  zmath; Math. Notes, 63:5 (1998), 699–701  isi 1
1995
6. E. A. Polyakov, “On resemblance and isomorphism types of partial recursive functions”, Sibirsk. Mat. Zh., 36:2 (1995),  390–396  mathnet  mathscinet  zmath; Siberian Math. J., 36:2 (1995), 343–347  isi 1
1991
7. E. A. Polyakov, “A universal partial recursive function”, Mat. Zametki, 49:2 (1991),  102–106  mathnet  mathscinet  zmath; Math. Notes, 49:2 (1991), 186–189  isi
1989
8. E. A. Polyakov, “On similarity types and recursive isomorphism of partial recursive functions”, Sibirsk. Mat. Zh., 30:6 (1989),  188–192  mathnet  mathscinet  zmath; Siberian Math. J., 30:6 (1989), 993–998  isi 1
1987
9. E. A. Polyakov, “Impossibility of finite generation of partial recursive functions by a unary isotone operation”, Mat. Zametki, 41:3 (1987),  429–432  mathnet  mathscinet  zmath; Math. Notes, 41:3 (1987), 245–247  isi
1980
10. E. A. Polyakov, “On the theory of recursive functionals and effective operations”, Izv. Vyssh. Uchebn. Zaved. Mat., 1980, no. 5,  37–39  mathnet  mathscinet  zmath
1978
11. E. A. Polyakov, M. G. Rozinas, “Relationships between different forms of relative computability of functions”, Mat. Sb. (N.S.), 107(149):1(9) (1978),  134–145  mathnet  mathscinet  zmath; Math. USSR-Sb., 35:3 (1979), 425–436  isi 4
1977
12. E. A. Polyakov, M. G. Rozinas, “Enumeration reducibility”, Sibirsk. Mat. Zh., 18:4 (1977),  838–845  mathnet  mathscinet  zmath; Siberian Math. J., 18:4 (1977), 594–599  isi 6
1968
13. E. A. Polyakov, “Some questions of recursive function theory”, Algebra Logika, 7:2 (1968),  77–84  mathnet  mathscinet
14. E. A. Polyakov, “Recursive subsets of sets of recursive functions”, Dokl. Akad. Nauk SSSR, 183:6 (1968),  1262–1264  mathnet  mathscinet  zmath
15. E. A. Polyakov, “Some properties of algebras of recursive functions”, Dokl. Akad. Nauk SSSR, 178:2 (1968),  296–298  mathnet  mathscinet  zmath
1966
16. I. A. Lavrov, E. A. Polyakov, “Bases of algebras of recursive functions”, Sibirsk. Mat. Zh., 7:5 (1966),  1059–1067  mathnet  mathscinet  zmath; Siberian Math. J., 7:5 (1966), 843–849
17. E. A. Polyakov, “On certain properties of algebras of recursive functions”, Sibirsk. Mat. Zh., 7:3 (1966),  720–723  mathnet  mathscinet  zmath; Siberian Math. J., 7:3 (1966), 574–576
1964
18. E. A. Polyakov, “Some properties of algebras of recursive functions”, Algebra i Logika. Sem., 3:3 (1964),  39–57  mathnet  mathscinet 1
19. E. A. Polyakov, “Algebras of recursive functions”, Algebra i Logika. Sem., 3:1 (1964),  41–56  mathnet  mathscinet

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