11 - 15 out of 15Page size: 10
  1. 2018

  2. A Computably Enumerable Partial Ordering Without Computably Enumerable Maximal Chains and Antichains

    Morozov, A. S., 1 May 2018, In: Siberian Mathematical Journal. 59, 3, p. 463-469 7 p.

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

  3. Nonpresentability of Some Structures of Analysis in Hereditarily Finite Superstructures

    Morozov, A. S., 1 Jan 2018, In: Algebra and Logic. 56, 6, p. 458-472 15 p.

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

  4. 2017

  5. On some reducibility and existential interpretability of structures

    Morozov, A. S., 1 Mar 2017, In: Siberian Mathematical Journal. 58, 2, p. 281-287 7 p.

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

  6. The Computational Power of Infinite Time Blum–Shub–Smale Machines

    Koepke, P. & Morozov, A. S., 1 Mar 2017, In: Algebra and Logic. 56, 1, p. 37-62 26 p.

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

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

Previous 1 2 Next

ID: 3438806