Ivan Soskov: A Life in Computability

Chapter
First Online:
Part of the Theory and Applications of Computability book series (THEOAPPLCOM)

Abstract

On May 5, 2013, the Bulgarian logic community lost one of its prominent members—Ivan Nikolaev Soskov. In this paper we shall give a glimpse of his scientific achievements.

Keywords

Jump Operator Primitive Function Enumeration Reducibility Mass Problem Joint Spectrum 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

References

  1. 1.
    C. Bianchini, Bounding Enumeration Degrees, Ph.D. thesis, University of Siena, 2000Google Scholar
  2. 2.
    R. Coles, R. Downey, T. Slaman, Every set has a least jump enumeration. J. Lond. Math. Soc. 62, 641–649 (1998)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    S.B. Cooper, Partial degrees and the density problem. Part 2: The enumeration degrees of the \(\Sigma _{2}\) sets are dense. J. Symb. Log. 49, 503–513 (1984)Google Scholar
  4. 4.
    A.P. Ershov, Abstract computability on algebraic structures, in Algorithms in Modern Mathematics and Computer Science. Lecture Notes in Computer Science, vol. 122 (Springer, Berlin, 1981), pp. 397–420Google Scholar
  5. 5.
    R.M. Friedberg, A criterion for completeness of degrees of unsolvability. J. Symb. Log. 22, 159–160 (1957)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    H. Friedman, Algorithmic procedures, generalized Turing algorithms and elementary recursion theory, in Logic Colloquium’69, ed. by R.O. Gandy, C.E.M. Yates (North-Holland, Amsterdam, 1971), pp. 361–389Google Scholar
  7. 7.
    H. Ganchev, A.C. Sariev, The ω-Turing degrees. Ann. Pure Appl. Log. 65 (9), 1512–1532 (2014)MathSciNetMATHGoogle Scholar
  8. 8.
    H. Ganchev, I.N. Soskov, The jump operator on the ω-enumeration degrees. Ann. Pure Appl. Log. 160 (3), 289–301 (2009)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    H. Ganchev, M.I. Soskova, The high/low hierarchy in the local structure of the ω-enumeration degrees. Ann. Pure Appl. Log. 163, 547–566 (2012)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    H. Ganchev, M.I. Soskova, Embedding distributive lattices in the \(\Sigma _{2}^{0}\) enumeration degrees. J. Log. Comput. 22, 779–792 (2012)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    H. Ganchev, M.I. Soskova, Cupping and definability in the local structure of the enumeration degrees. J. Symb. Log. 77, 133–158 (2012)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    H. Ganchev, M.I. Soskova, Interpreting true arithmetic in the local structure of the enumeration degrees. J. Symb. Log. 77, 1184–1194 (2012)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    H. Ganchev, M.I. Soskova, Definability via Kalimullin pairs in the structure of the enumeration degrees. Trans. Am. Math. Soc. 367, 4873–4893 (2015)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    S.S. Goncharov, V.S. Harizanov, J.F. Knight, R.A. Shore, \(\Pi _{1}^{1}\) relations and paths through \(\mathcal{O}\). J. Symb. Log. 69, 585–611 (2004)Google Scholar
  15. 15.
    C.E. Gordon, Prime and search computability characterized as definability in certain sublanguages of constructible \(L_{\omega _{1},\omega }\). Trans. Am. Math. Soc. 197, 391–407 (1974)MATHGoogle Scholar
  16. 16.
    I.S. Kalimullin, Definability of the jump operator in the enumeration degrees. J. Math. Log. 3, 257–267 (2003)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    J.F. Knight, Degrees coded in jumps of orderings. J. Symb. Log. 51, 1034–1042 (1986)MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    D. Lacombe, Deux généralisations de la notion de récursivité relative. C. R. Acad. Sci. Paris 258, 3410–3413 (1964)MathSciNetMATHGoogle Scholar
  19. 19.
    K. McEvoy, Jumps of quasi-minimal enumeration degrees. J. Symb. Log. 50, 839–848 (1985)MathSciNetCrossRefMATHGoogle Scholar
  20. 20.
    K. McEvoy, S.B. Cooper, On minimal pairs of enumeration degrees. J. Symb. Log. 50, 983–1001 (1985)MathSciNetCrossRefMATHGoogle Scholar
  21. 21.
    A. Montalban, Notes on the jump of a structure, in Mathematical Theory and Computational Practice (Springer, Berlin, 2009), pp. 372–378CrossRefMATHGoogle Scholar
  22. 22.
    Y.N. Moschovakis, Abstract first order computability. I. Trans. Am. Math. Soc. 138, 427–464 (1969)MathSciNetMATHGoogle Scholar
  23. 23.
    Y.N. Moschovakis, Abstract computability and invariant definability. J. Symb. Log. 34, 605–633 (1969)MathSciNetCrossRefMATHGoogle Scholar
  24. 24.
    Y.N. Moschovakis, Elementary Induction on Abstract Structures (North-Holland, Amsterdam, 1974)MATHGoogle Scholar
  25. 25.
    V.A. Nepomniaschy, Criteria for the algorithmic completeness of systems of operations, in Programming Theory. Proceedings of a Symposium (Novosibirsk, 7–11 Aug 1972), Part 1, ed. by V.A. Nepomnyaschy (Computer Centre of the Siberian Branch of the Soviet Academy of Sciences, Novosibirsk, 1972), pp. 267–279 [in Russian]Google Scholar
  26. 26.
    L.J. Richter, Degrees of Structures. J. Symb. Log. 46, 723–731 (1981)CrossRefGoogle Scholar
  27. 27.
    G.E. Sacks, Degrees of Unsolvability (Princeton University Press, Princeton, 1963)MATHGoogle Scholar
  28. 28.
    L.E. Sanchis, Hyperenumeration reducibility. Notre Dame J. Formal Logic 19, 405–415 (1978)MathSciNetCrossRefMATHGoogle Scholar
  29. 29.
    L.E. Sanchis, Reducibilities in two models of combinatory logic. J. Symb. Log. 44, 221–234 (1979)MathSciNetCrossRefMATHGoogle Scholar
  30. 30.
    A.L. Selman, Arithmetical reducibilities I. Z. Math. Logik Grundlag. Math. 17, 335–350 (1971)MathSciNetCrossRefMATHGoogle Scholar
  31. 31.
    J.C. Shepherdson, Computation over abstract structures, in Logic Colloquium’73, ed. by H.E. Rose, J.C. Shepherdson (North-Holland, Amsterdam, 1975), pp. 445–513Google Scholar
  32. 32.
    D. Skordev, Combinatory spaces and recursiveness in them (Publisher House of the Bulgarian Academy of Science, Sofia 1980) [in Russian]MATHGoogle Scholar
  33. 33.
    D. Skordev, Computability in Combinatory Spaces. An Algebraic Generalization of Abstract First Order Computability (Kluwer Academic Publishers, Dordrecht, 1992)Google Scholar
  34. 34.
    T.A. Slaman, A. Sorbi, Quasi-minimal enumeration degrees and minimal Turing degrees. Mat. Pura Appl. 174, 97–120 (1998)MathSciNetCrossRefMATHGoogle Scholar
  35. 35.
    I.N. Soskov, Prime computable functions of finitely many arguments with argument and function values in the basic set. M.Sc. thesis, Sofia University, 1979 [in Bulgarian]Google Scholar
  36. 36.
    I.N. Soskov, Prime computable functions in the basic set, in Mathematical Logic. Proceedings of the Conference on Mathematical Logic. Dedicated to the memory of A.A. Markov (1903–1979), (Sofia, 22–23 Sept 1980) ed. by D. Skordev (Publishers House of the Bulgarian Academy of Sciences, Sofia, 1984), pp. 112–138 [in Russian]Google Scholar
  37. 37.
    I.N. Soskov, An example of a basis which is Moschovakis complete without being program complete, in Mathematical Theory and Practice of Program Systems, ed. by A.P. Ershov (Computer Centre of the Siberian Branch of the Soviet Academy of Sciences, Novosibirsk, 1982), pp. 26–33 [in Russian]Google Scholar
  38. 38.
    I.N. Soskov, Computability in algebraic systems. C.R. Acad. Bulg. Sci. 36, 301–304 (1983) [in Russian]Google Scholar
  39. 39.
    I.N. Soskov, Algorithmically complete algebraic systems, C. R. Acad. Bulg. Sci. 36, 729–731 (1983) [in Russian]MathSciNetMATHGoogle Scholar
  40. 40.
    I.N. Soskov, Computability over partial algebraic systems. Ph.D. thesis, Sofia University, 1983 [in Bulgarian]Google Scholar
  41. 41.
    I.N. Soskov, The connection between prime computability and recursiveness in functional combinatory spaces, in Mathematical Theory of Programming, ed. by A.P. Ershov, D. Skordev. Computer Centre of the Siberian Branch of the Soviet Academy of Sciences, Novosibirsk, 1985, pp. 4–11 [in Russian]Google Scholar
  42. 42.
    I.N. Soskov, Prime computability on partial structures, in Mathematical Logic and its Applications. Proceedings of an Advanced International Summer School and Conference on Mathematical Logic and Its Applications in honor of the 80th anniversary of Kurt Gödel’s birth (Druzhba, Bulgaria, 24 Sept–4 Oct 1986) ed. by D. Skordev (Plenum Press, New York, 1987), pp. 341–350Google Scholar
  43. 43.
    I.N. Soskov, Definability via enumerations. J. Symb. Log. 54, 428–440 (1989)MathSciNetCrossRefMATHGoogle Scholar
  44. 44.
    I.N. Soskov, An external characterization of the prime computability. Ann. Univ. Sofia 83, livre 1 – Math. 89–111 (1989)Google Scholar
  45. 45.
    I.N. Soskov, Maximal concepts of computability and maximal programming languages, Technical Report, Contract no. 247/1987 with the Ministry of Culture, Science and Education, Laboratory for Applied Logic, Sofia University (1989)Google Scholar
  46. 46.
    I.N. Soskov, Horn clause programs on abstract structures with parameters (extended abstract). Ann. Univ. Sofia 84, livre 1 – Math. 53–61 (1990)Google Scholar
  47. 47.
    I.N. Soskov, On the computational power of the logic programs, in Mathematical Logic. Proceedings of the Summer School and Conference on Math. Logic, honourably dedicated to the 90th anniversary of Arend Heyting (1898–1980) (Chaika (near Varna), Bulgaria, 13–23 Sept 1988) ed. by P. Petkov (Plenum Press, New York, 1990), pp. 117–137Google Scholar
  48. 48.
    I.N. Soskov, Computability by means of effectively definable schemes and definability via enumerations. J. Symb. Log. 55, 430–431 (1990) [abstract]Google Scholar
  49. 49.
    I.N. Soskov, Computability by means of effectively definable schemes and definability via enumerations. Arch. Math. Logic 29, 187–200 (1990)MathSciNetCrossRefMATHGoogle Scholar
  50. 50.
    I.N. Soskov, Second order definability via enumerations. Zeitschr. f. math Logik und Grundlagen d. Math. 37, 45–54 (1991)MathSciNetCrossRefMATHGoogle Scholar
  51. 51.
    I.N. Soskov, Maximal concepts of computability on abstract structures. J. Symb. Log. 57, 337–338 (1992) [abstract]Google Scholar
  52. 52.
    I.N. Soskov, Intrinsically \(\Pi _{1}^{1}\)-relations. Math. Log. Q. 42, 109–126 (1996)MathSciNetCrossRefMATHGoogle Scholar
  53. 53.
    I.N. Soskov, Intrinsically hyperarithmetical sets. Math. Log. Q. 42, 469–480 (1996)MathSciNetCrossRefMATHGoogle Scholar
  54. 54.
    I.N. Soskov, Constructing minimal pairs of degrees. Ann. Univ. Sofia 88, 101–112 (1997)MATHGoogle Scholar
  55. 55.
    I.N. Soskov, Abstract computability and definability: external approach. Dr. Hab. thesis, Sofia University, 2000 [in Bulgarian]Google Scholar
  56. 56.
    I.N. Soskov, A jump inversion theorem for the enumeration jump. Arch. Math. Log. 39, 417–437 (2000)MathSciNetCrossRefMATHGoogle Scholar
  57. 57.
    I.N. Soskov, Degree spectra and co-spectra of structures. Ann. Univ. Sofia 96, 45–68 (2004)MathSciNetMATHGoogle Scholar
  58. 58.
    I.N. Soskov, The ω-enumeration degrees. J. Log. Comput. 17, 1193–1214 (2007)MathSciNetCrossRefMATHGoogle Scholar
  59. 59.
    I.N. Soskov, Effective properties of Marker’s extensions. J. Log. Comput. 23 (6), 1335–1367 (2013)MathSciNetCrossRefMATHGoogle Scholar
  60. 60.
    I.N. Soskov, A note on ω-jump inversion of degree spectra of structures, in The Nature of Computation. Logic, Algorithms, Applications. Lecture Notes in Computer Science, vol. 7921 (Springer, Berlin, 2013), pp. 365–370Google Scholar
  61. 61.
    I.N. Soskov, V. Baleva, Regular enumerations. J. Symb. Log. 67, 1323–1343 (2002)MathSciNetCrossRefMATHGoogle Scholar
  62. 62.
    I. Soskov, B. Kovachev, Uniform regular enumerations. Math. Struct. Comput. Sci. 16 (5), 901–924 (2006)MathSciNetCrossRefMATHGoogle Scholar
  63. 63.
    I.N. Soskov, M.I. Soskova, Kalimullin pairs of \(\Sigma _{2}^{0}\) omega-enumeration degrees. J. Softw. Inf. 5, 637–658 (2011)Google Scholar
  64. 64.
    A.A. Soskova, Minimal pairs and quasi-minimal degrees for the joint spectra of structures, in New Computational Paradigms. Lecture Notes in Computer Science, vol. 3526 (Springer, Berlin, 2005), pp. 451–460Google Scholar
  65. 65.
    A.A. Soskova, I.N. Soskov, Effective enumerations of abstract structures, in Mathematical Logic. Proceedings of the Summer School and Conference on Mathematical Logic, honourably dedicated to the 90th anniversary of Arend Heyting (1898–1980) (Chaika (near Varna), Bulgaria, 13–23 Sept 1988) ed. by P. Petkov (Plenum Press, New York, 1990), pp. 361–372Google Scholar
  66. 66.
    A.A. Soskova, I.N. Soskov, Co-spectra of joint spectra of structures. Ann. Sofia Univ. Fac. Math. Inf. 96, 35–44 (2004)MathSciNetMATHGoogle Scholar
  67. 67.
    A.A. Soskova, I.N. Soskov, A jump inversion theorem for the degree spectra. J. Log. Comput. 19, 199–215 (2009)MathSciNetCrossRefMATHGoogle Scholar
  68. 68.
    M.I. Soskova, I.N. Soskov, Embedding countable partial orderings into the enumeration and ω-enumeration degrees. J. Log. Comput. 22, 927–952 (2012)CrossRefMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Faculty of Mathematics and InformaticsSofia UniversitySofiaBulgaria

Personalised recommendations