3421 - 3430 out of 26,307Page size: 10
  1. 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 journalArticlepeer-review

  2. Computable Functionals of Finite Types in Montague Semantics

    Бурнистов, А. С. & Стукачев, А. И., 2024, In: Сибирские электронные математические известия. 21, 2, p. 1460-1472 13 p.

    Research output: Contribution to journalArticlepeer-review

  3. Computable isomorphisms of distributive lattices

    Bazhenov, N., Mustafa, M. & Yamaleev, M., 1 Jan 2019, Theory and Applications of Models of Computation - 15th Annual Conference, TAMC 2019, Proceedings. Watada, J. & Gopal, T. V. (eds.). Springer, p. 28-41 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11436 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  4. Computable metrics above the standard real metric

    Kornev, R., 2021, In: Siberian Electronic Mathematical Reports. 18, 1, p. 377-392 16 p., 29.

    Research output: Contribution to journalArticlepeer-review

  5. Computable model theory over the reals

    Morozov, A. S., 1 Jan 2017, In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 10010, p. 354-365 12 p.

    Research output: Contribution to journalArticlepeer-review

  6. Computable Numberings of Families of Infinite Sets

    Dorzhieva, M. V., 1 Jul 2019, In: Algebra and Logic. 58, 3, p. 224-231 8 p.

    Research output: Contribution to journalArticlepeer-review

  7. Computable Positive and Friedberg Numberings in Hyperarithmetic

    Kalimullin, I. S., Puzarenko, V. G. & Faizrakhmanov, M. K., 1 Mar 2020, In: Algebra and Logic. 59, 1, p. 46-58 13 p.

    Research output: Contribution to journalArticlepeer-review

  8. Computable Stone spaces

    Bazhenov, N., Harrison-Trainor, M. & Melnikov, A., 1 Oct 2023, In: Annals of Pure and Applied Logic. 174, 9, 25 p., 103304.

    Research output: Contribution to journalArticlepeer-review

  9. Computable Topology for Reliable Computations

    Korovina, M. & Kudinov, O., 1 Jan 2019, Perspectives of System Informatics - 12th International Andrei P. Ershov Informatics Conference, PSI 2019, Revised Selected Papers. Bjørner, N., Virbitskaite, I. & Voronkov, A. (eds.). Springer International Publishing AG, p. 185-198 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11964 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  10. Computably and punctually universal spaces

    Bagaviev, R., Batyrshin, I. I., Bazhenov, N., Bushtets, D., Dorzhieva, M., Koh, H. T., Kornev, R., Melnikov, A. G. & Ng, K. M., Jan 2025, In: Annals of Pure and Applied Logic. 176, 1, 103491.

    Research output: Contribution to journalArticlepeer-review