1 - 10 out of 10Page size: 10
  1. 2024

  2. Isomorphism Types of Rogers Semilattices in the Analytical Hierarchy

    Bazhenov, N., Ospichev, S. & Yamaleev, M., 2024, Lecture Notes Series, Institute for Mathematical Sciences. World Scientific, p. 97-114 18 p. (Lecture Notes Series, Institute for Mathematical Sciences; vol. 42).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Research › peer-review

  3. 2021

  4. On Universal Pairs in the Ershov Hierarchy

    Bazhenov, N. A., Mustafa, M. & Ospichev, S. S., Jan 2021, In: Siberian Mathematical Journal. 62, 1, p. 23-31 9 p.

    Research output: Contribution to journal › Article › peer-review

  5. 2020

  6. Numberings in the Analytical Hierarchy

    Bazhenov, N. A., Mustafa, M., Ospichev, S. S. & Yamaleev, M. M., Nov 2020, In: Algebra and Logic. 59, 5, p. 404-407 4 p.

    Research output: Contribution to journal › Article › peer-review

  7. Semilattices of Punctual Numberings

    Bazhenov, N., Mustafa, M. & Ospichev, S., 2020, Theory and Applications of Models of Computation - 16th International Conference, TAMC 2020, Proceedings. Chen, J., Feng, Q. & Xu, J. (eds.). Springer Science and Business Media Deutschland GmbH, p. 1-12 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12337 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  8. The expressiveness of looping terms in the semantic programming

    Goncharov, S., Ospichev, S., Ponomaryov, D. & Sviridenko, D., 2020, In: Сибирские электронные математические известия. 17, p. 380-394 15 p., 024.

    Research output: Contribution to journal › Article › peer-review

  9. 2019

  10. Bounded Reducibility for Computable Numberings

    Bazhenov, N., Mustafa, M. & Ospichev, S., 1 Jan 2019, Computing with Foresight and Industry - 15th Conference on Computability in Europe, CiE 2019, Proceedings. Manea, F., Martin, B., Paulusma, D. & Primiero, G. (eds.). Springer-Verlag GmbH and Co. KG, p. 96-107 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11558 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  11. Friedberg numberings of families of partial computable functionals

    Ospichev, S., 1 Jan 2019, In: Сибирские электронные математические известия. 16, p. 331-339 9 p.

    Research output: Contribution to journal › Article › peer-review

  12. 2018

  13. On the complexity of formulas in semantic programming

    Ospichev, S. & Ponomarev, D., 1 Jan 2018, In: Сибирские электронные математические известия. 15, p. 987-995 9 p.

    Research output: Contribution to journal › Article › peer-review

  14. 2016

  15. Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings

    Ospichev, S. S., 1 Jun 2016, In: Journal of Mathematical Sciences (United States). 215, 4, p. 529-536 8 p.

    Research output: Contribution to journal › Article › peer-review

  16. 2015

  17. Friedberg Numberings in the Ershov Hierarchy

    Ospichev, S. S., Sept 2015, In: Algebra and Logic. 54, 4, p. 283-295 13 p.

    Research output: Contribution to journal › Article › peer-review

ID: 3440523