Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Degtev, Aleksandr Nikolaevich
(1947–2013)
Statistics Math-Net.Ru
Total publications: 43
Scientific articles: 43

Number of views:
This page:1624
Abstract pages:6374
Full texts:2868
References:377
Professor
Website: http://tm-courier.ru/archives/38283

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

Publications in Math-Net.Ru Citations
2011
1. A. N. Dyogtev, “New series of weakly implicative selector sets”, Izv. Vyssh. Uchebn. Zaved. Mat., 2011, no. 7,  22–27  mathnet  mathscinet; Russian Math. (Iz. VUZ), 55:7 (2011), 17–22  scopus
2008
2. A. N. Degtev, M. L. Platonov, “$e$-principal numberings”, Sibirsk. Mat. Zh., 49:2 (2008),  299–307  mathnet  mathscinet  zmath  elib; Siberian Math. J., 49:2 (2008), 239–245  isi  elib  scopus 5
2005
3. A. N. Degtev, “On generalisations of the notion of semirecursiveness”, Diskr. Mat., 17:2 (2005),  144–149  mathnet  mathscinet  zmath  elib; Discrete Math. Appl., 15:2 (2005), 201–206
2001
4. A. N. Degtev, “On $p$-Reducibility of Computable Numerations”, Mat. Zametki, 69:1 (2001),  31–35  mathnet  mathscinet  zmath  elib; Math. Notes, 69:1 (2001), 28–31  isi 2
2000
5. A. N. Degtev, “Almost Combinatorial Selector Sets”, Mat. Zametki, 68:6 (2000),  851–853  mathnet  mathscinet  zmath; Math. Notes, 68:6 (2000), 721–723  isi 3
6. A. N. Degtev, E. S. Sakunova, “On reducibility of partial recursive functions”, Sibirsk. Mat. Zh., 41:6 (2000),  1345–1349  mathnet  mathscinet  zmath; Siberian Math. J., 41:6 (2000), 1111–1114  isi
1999
7. A. N. Degtev, D. I. Ivanov, “Weakly implicative selector sets of dimension 3”, Diskr. Mat., 11:3 (1999),  126–132  mathnet  mathscinet  zmath; Discrete Math. Appl., 9:4 (1999), 395–402 5
8. A. N. Degtev, “Almost semirecursive sets”, Mat. Zametki, 66:2 (1999),  188–193  mathnet  mathscinet  zmath; Math. Notes, 66:2 (1999), 148–152  isi 2
1998
9. A. N. Degtev, D. I. Ivanov, “Weakly combinatorial selector sets”, Algebra Logika, 37:6 (1998),  627–636  mathnet  mathscinet 4
1996
10. A. N. Degtev, “Implicative selector sets”, Algebra Logika, 35:2 (1996),  145–153  mathnet  mathscinet 3
1995
11. A. N. Degtev, “On relations between complete sets”, Izv. Vyssh. Uchebn. Zaved. Mat., 1995, no. 3,  8–14  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 39:3 (1995), 6–12
1993
12. A. N. Degtev, “On the intersection of some classes of convergences”, Diskr. Mat., 5:4 (1993),  24–28  mathnet  mathscinet  zmath
13. A. N. Degtev, “Some properties of deducibility operators”, Mat. Zametki, 53:3 (1993),  23–28  mathnet  mathscinet  zmath; Math. Notes, 53:3 (1993), 259–262  isi
14. A. N. Degtev, “On multiple positive reducibility”, Sibirsk. Mat. Zh., 34:2 (1993),  74–76  mathnet  mathscinet  zmath; Siberian Math. J., 34:2 (1993), 263–265  isi
1991
15. A. N. Degtev, “The semilattice of computable families of recursively enumerable sets”, Mat. Zametki, 50:4 (1991),  61–66  mathnet  mathscinet  zmath; Math. Notes, 50:4 (1991), 1027–1030  isi 1
1990
16. A. N. Degtev, “Weak combinatorial-selective properties of subsets of the natural numbers”, Algebra Logika, 29:4 (1990),  421–429  mathnet  mathscinet 3
17. A. N. Degtev, “Recursive-combinatorial properties of subsets of natural numbers”, Algebra Logika, 29:3 (1990),  303–314  mathnet  mathscinet 6
1989
18. A. N. Degtev, “A problem of P. Odifreddi”, Sibirsk. Mat. Zh., 30:1 (1989),  185–187  mathnet  mathscinet  zmath; Siberian Math. J., 30:1 (1989), 144–146  isi 1
1988
19. A. N. Degtev, “Some lattice-invariant properties of families of recursively enumerable sets”, Algebra Logika, 27:5 (1988),  527–534  mathnet  mathscinet
1987
20. A. N. Degtev, “Computable numberings to which noncomputable numberings are positively reducible”, Mat. Zametki, 42:5 (1987),  723–728  mathnet  mathscinet  zmath; Math. Notes, 42:5 (1987), 898–900  isi 1
1985
21. A. N. Degtev, “Semilattices of disjunctive and linear degrees”, Mat. Zametki, 38:2 (1985),  310–316  mathnet  mathscinet  zmath; Math. Notes, 38:2 (1985), 681–684  isi
1984
22. A. N. Degtev, “A category of enumerated sets”, Mat. Zametki, 36:2 (1984),  261–268  mathnet  mathscinet  zmath; Math. Notes, 36:2 (1984), 623–627  isi 1
1983
23. A. N. Degtev, “Relations between reducibilities of tabular type”, Algebra Logika, 22:3 (1983),  243–259  mathnet  mathscinet
24. A. N. Degtev, “Relationships between degrees of tabular type”, Algebra Logika, 22:1 (1983),  35–52  mathnet  mathscinet
1982
25. A. N. Degtev, “Comparison of linear reducibility with other reducibilities of tabular type”, Algebra Logika, 21:5 (1982),  511–529  mathnet  mathscinet 1
1981
26. A. N. Degtev, “Relations between complete sets”, Izv. Vyssh. Uchebn. Zaved. Mat., 1981, no. 5,  50–55  mathnet  mathscinet  zmath
1980
27. A. N. Degtev, “On reducibilities of numerations”, Mat. Sb. (N.S.), 112(154):2(6) (1980),  207–219  mathnet  mathscinet  zmath; Math. USSR-Sb., 40:2 (1981), 193–204  isi 8
28. A. N. Degtev, “A category of partial recursive functions”, Sibirsk. Mat. Zh., 21:3 (1980),  89–97  mathnet  mathscinet  zmath; Siberian Math. J., 21:3 (1980), 382–388  isi
1979
29. A. N. Degtev, “Some results on upper semilattices and $m$-degrees”, Algebra Logika, 18:6 (1979),  664–679  mathnet  mathscinet 2
30. A. N. Degtev, “Reducibilities of tabular type in the theory of algorithms”, Uspekhi Mat. Nauk, 34:3(207) (1979),  137–168  mathnet  mathscinet  zmath; Russian Math. Surveys, 34:3 (1979), 155–192 4
1978
31. A. N. Degtev, “Three theorems on $tt$-degrees”, Algebra Logika, 17:3 (1978),  270–281  mathnet  mathscinet
32. A. N. Degtev, “Decidability of the $\forall \exists $-theory of a certain factor-lattice of recursively enumerable sets”, Algebra Logika, 17:2 (1978),  134–143  mathnet  mathscinet 1
33. A. N. Degtev, “$m$-Degrees of supersets of simple sets”, Mat. Zametki, 23:6 (1978),  889–893  mathnet  mathscinet  zmath; Math. Notes, 23:6 (1987), 488–490 1
1977
34. A. N. Degtev, “A family of maximal subalgebras of R. Robinson's algebra”, Mat. Zametki, 22:4 (1977),  511–516  mathnet  mathscinet  zmath; Math. Notes, 22:4 (1977), 775–778
35. A. N. Degtev, “Reducibility of partially-recursive functions. II”, Sibirsk. Mat. Zh., 18:4 (1977),  765–774  mathnet  mathscinet  zmath; Siberian Math. J., 18:4 (1977), 541–548  isi 1
1976
36. A. N. Degtev, “Partially ordered sets of $1$-degrees that occur in recursively enumerable $m$-degrees”, Algebra Logika, 15:3 (1976),  249–266  mathnet  mathscinet 2
37. A. N. Degtev, “Minimal $1$-degrees, and truth-table reducibility”, Sibirsk. Mat. Zh., 17:5 (1976),  1014–1022  mathnet  mathscinet  zmath; Siberian Math. J., 17:5 (1976), 751–757  isi 3
1975
38. A. N. Degtev, “Reducibility of partially recursive functions”, Sibirsk. Mat. Zh., 16:5 (1975),  970–988  mathnet  mathscinet  zmath; Siberian Math. J., 16:5 (1975), 741–754  isi 1
1973
39. A. N. Degtev, “$tt$- and $m$-degrees”, Algebra Logika, 12:2 (1973),  143–161  mathnet  mathscinet 8
1972
40. A. N. Degtev, “Hereditary sets and truth-table reducibility”, Algebra Logika, 11:3 (1972),  257–269  mathnet  mathscinet 3
41. A. N. Degtev, “The $m$-degrees of simple sets”, Algebra Logika, 11:2 (1972),  130–139  mathnet  mathscinet 3
1971
42. A. N. Degtev, “Hypersimple sets with retraceable complements”, Algebra Logika, 10:3 (1971),  235–246  mathnet  mathscinet 1
1970
43. A. N. Degtev, “Several remarks on retraceable, regressive and pointwise decomposable sets”, Algebra Logika, 9:6 (1970),  651–660  mathnet  mathscinet

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