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
Parents
21
Effective categoricity of equivalence structures
Wesley Calvert, Douglas Cenzer, Valentina Harizanov et al. · Annals of Pure and Applied Logic · 2005 · 59 citations
1–5 of 21
39
3
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 39
36
University of Wisconsin–Madison
Madison, United States
4 h-index
4 publications
312 citations

Queens College, CUNY
New York, United States
4 h-index
4 publications
205 citations

Kazan Federal University
Kazan’, Russia
4 h-index
7 publications
210 citations

University of Waterloo
Waterloo, Canada
3 h-index
6 publications
232 citations

The Graduate Center, CUNY
New York, United States
3 h-index
3 publications
159 citations

Victoria University of Wellington
Wellington, New Zealand
3 h-index
3 publications
91 citations
University of Chicago
Chicago, United States
2 h-index
3 publications
135 citations
University of Florida
Gainesville, United States
2 h-index
2 publications
71 citations
1–8 of 36
6 publications · 139 citations
6
h-index
3 publications · 82 citations
3
h-index
2 publications · 91 citations
2
h-index
TRAN · 2 publications · 129 citations
2
h-index
2 publications · 119 citations
2
h-index
1–5