Computable Structure Theory

Computable Structure Theory is a branch of mathematical logic and computability theory that studies the effectiveness of algebraic and relational structures by analyzing the degree to which their isomorphisms, definable properties, and constructions can be realized by computable functions.

100

Publications

3.2K

Citations

108

Authors

77

Institutions

Publications per year

2017–2026

15

Authors

108

  1. VH
    Valentina Harizanov

    George Washington University, United States

    11 publications · 362 citations

    11

    h-index

  2. JF
    Julia F. Knight

    University of Notre Dame, United States

    8 publications · 235 citations

    8

    h-index

  3. RA
    Richard A. Shore

    Cornell University, United States

    7 publications · 407 citations

    7

    h-index

  4. BK
    Bakhadyr Khoussainov

    University of Auckland, New Zealand

    6 publications · 331 citations

    6

    h-index

  5. DR
    Denis R. Hirschfeldt

    University of Chicago, United States

    6 publications · 244 citations

    6

    h-index

1–5 of 108

Venues

  1. Journal of Symbolic Logic

    23 publications · 574 citations

    15

    h-index

  2. Algebra and Logic

    16 publications · 575 citations

    13

    h-index

  3. Notre Dame Journal of Formal Logic

    6 publications · 227 citations

    6

    h-index

  4. Annals of Pure and Applied Logic

    5 publications · 348 citations

    5

    h-index

  5. Bulletin of Symbolic Logic

    6 publications · 143 citations

    5

    h-index

1–5