Complexity of Categorical Theories with Computable Models

Recursively enumerable sets and degrees

Robert I. Soare · Bulletin of the American Mathematical Society · 1978 · 1.6K citations · Full text

Natural Sciences, Computer Science, Mathematics +15

On strongly minimal sets

John T. Baldwin, A. H. Lachlan · Journal of Symbolic Logic · 1971 · 218 citations

Natural Sciences, Mathematics, Logic +5

Recursively presentable prime models

Leo Harrington · Journal of Symbolic Logic · 1974 · 88 citations

Humanities, Computer Science, Mathematics +9

Computable Models of Theories with Few Models

Bakhadyr Khoussainov, André Nies, Richard A. Shore · Notre Dame Journal of Formal Logic · 1997 · 73 citations · Full text

Computing, Computer Science, Mathematics +13

Complexity of Categorical Theories with Computable Models

Bakh Khoussainov · Algebra and Logic · 2004 · 34 citations

Computing, Computer Science, Mathematics +13