Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)



The degrees of categorical theories with recursive models

Author: Uri Andrews
Journal: Proc. Amer. Math. Soc. 141 (2013), 2501-2514
MSC (2010): Primary 03C98, 03D99
Published electronically: February 26, 2013
MathSciNet review: 3043030
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: We show that even for categorical theories, recursiveness of the models guarantees no information regarding the complexity of the theory. In particular, we show that every tt-degree reducible to $ 0^{(\omega )}$ contains both $ \aleph _1$-categorical and $ \aleph _0$-categorical theories in finite languages, all of whose countable models have recursive presentations.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC (2010): 03C98, 03D99

Retrieve articles in all journals with MSC (2010): 03C98, 03D99

Additional Information

Uri Andrews
Affiliation: Department of Mathematics, University of Wisconsin, 480 Lincoln Drive, Madison, Wisconsin 53706

Received by editor(s): August 8, 2011
Received by editor(s) in revised form: October 11, 2011
Published electronically: February 26, 2013
Communicated by: Julia Knight
Article copyright: © Copyright 2013 American Mathematical Society
The copyright for this article reverts to public domain 28 years after publication.