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
Parents
100
Computable Structure and Non-Structure Theorems
Julia F. Knight · Algebra and Logic · 2002 · 109 citations
Enumerations in computable structure theory
Valentina Harizanov, Julia A. Knight, Charles A. McCoy et al. · Annals of Pure and Applied Logic · 2005 · 99 citations
1–5 of 100
108
11
h-index
8
h-index
7
h-index
6
h-index
6
h-index
1–5 of 108
77

University of Notre Dame
Notre Dame, United States
12 h-index
15 publications
577 citations
George Washington University
Washington, United States
11 h-index
12 publications
377 citations
University of Chicago
Chicago, United States
10 h-index
12 publications
306 citations

Cornell University
Ithaca, United States
9 h-index
15 publications
934 citations
Sobolev Institute of Mathematics
Novosibirsk, Russia
9 h-index
12 publications
248 citations

Kazan Federal University
Kazan’, Russia
9 h-index
12 publications
324 citations

University of Auckland
Auckland, New Zealand
8 h-index
10 publications
527 citations

Queens College, CUNY
New York, United States
7 h-index
7 publications
324 citations
1–8 of 77
23 publications · 574 citations
15
h-index
16 publications · 575 citations
13
h-index
6 publications · 227 citations
6
h-index
5 publications · 348 citations
5
h-index
6 publications · 143 citations
5
h-index
1–5