Computable Categoricity

Computable Categoricity is a property of a countable structure in computable model theory asserting that every computable copy of the structure is isomorphic to it via a computable isomorphism.

21

Publications

879

Citations

39

Authors

36

Institutions

Publications per year

2017–2026

4

Authors

39

  1. SL
    Steffen Lempp

    University of Wisconsin–Madison, United States

    3 publications · 125 citations

    3

    h-index

  2. RM
    Russell Miller

    Queens College, CUNY, United States

    3 publications · 159 citations

    3

    h-index

  3. BF
    Barbara F. Csima

    University of Waterloo, Canada

    3 publications · 89 citations

    3

    h-index

  4. DT
    Daniel Turetsky

    Victoria University of Wellington, New Zealand

    3 publications · 91 citations

    3

    h-index

  5. IS
    I. Sh. Kalimullin

    Kazan Federal University, Russia

    3 publications · 129 citations

    3

    h-index

1–5 of 39

Venues

  1. Journal of Symbolic Logic

    6 publications · 139 citations

    6

    h-index

  2. Annals of Pure and Applied Logic

    3 publications · 82 citations

    3

    h-index

  3. Notre Dame Journal of Formal Logic

    2 publications · 91 citations

    2

    h-index

  4. Transactions of the American Mathematical Society

    TRAN · 2 publications · 129 citations

    2

    h-index

  5. Archive for Mathematical Logic

    2 publications · 119 citations

    2

    h-index

1–5