22551 - 22560 out of 25,941Page size: 10
Sort by: Title

  1. 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 journal › Article › peer-review

  2. 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 journal › Article › peer-review

  3. 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 journal › Article › peer-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 journal › Article › peer-review

  5. 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 proceeding › Conference contribution › Research › peer-review

  6. Computable Functionals of Finite Types in Montague Semantics

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

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

  7. 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

  8. Computable Contact Algebras

    Bazhenov, N., 1 Jan 2019, In: Fundamenta Informaticae. 167, 4, p. 257-269 13 p.

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

  9. Computable Boolean Algebras and Complexity of the Fréchet Ideal

    Goncharov, S. S., Sept 2024, In: Journal of Mathematical Sciences (United States). 284, 1, p. 72-82 11 p.

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

  10. Computable Bi-Embeddable Categoricity

    Bazhenov, N. A., Fokina, E. B., Rossegger, D. & San Mauro, L., 1 Nov 2018, In: Algebra and Logic. 57, 5, p. 392-396 5 p.

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

Previous 1...2252 2253 2254 2255 2256 2257 2258 2259 ...2595 Next