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

  2. Complexity of the Problem of ∀-Representation for Sentences

    Когабаев, Н. Т., Sept 2024, In: Algebra and Logic. 62, 4, p. 372-375 4 p.

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

  3. 2020

  4. On the for all there exists-Theories of Free Projective Planes

    Kogabaev, N. T., Jan 2020, In: Siberian Mathematical Journal. 61, 1, p. 95-108 14 p.

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

  5. 2018

  6. Complexity of the Isomorphism Problem for Computable Free Projective Planes of Finite Rank

    Kogabaev, N. T., 1 Mar 2018, In: Siberian Mathematical Journal. 59, 2, p. 295-308 14 p.

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

  7. 2017

  8. The Embedding Problem for Computable Projective Planes

    Kogabaev, N. T., 1 Mar 2017, In: Algebra and Logic. 56, 1, p. 75-79 5 p.

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

  9. Freely Generated Projective Planes with Finite Computable Dimension

    Kogabaev, N. T., 1 Jan 2017, In: Algebra and Logic. 55, 6, p. 461-484 24 p.

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

ID: 3439699