An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated

Notre Dame Journal of Formal Logic 47 (1):63-71 (2006)
  Copy   BIBTEX

Abstract

We build an א₁-categorical but not א₀-categorical theory whose only computably presentable model is the saturated one. As a tool, we introduce a notion related to limitwise monotonic functions

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,505

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Degrees That Are Not Degrees of Categoricity.Bernard Anderson & Barbara Csima - 2016 - Notre Dame Journal of Formal Logic 57 (3):389-398.
Computable Models of Theories with Few Models.Bakhadyr Khoussainov, Andre Nies & Richard A. Shore - 1997 - Notre Dame Journal of Formal Logic 38 (2):165-178.
Order-Computable Sets.Denis Hirschfeldt, Russell Miller & Sergei Podzorov - 2007 - Notre Dame Journal of Formal Logic 48 (3):317-347.

Analytics

Added to PP
2010-08-24

Downloads
44 (#507,227)

6 months
14 (#232,731)

Historical graph of downloads
How can I increase my downloads?

References found in this work

On strongly minimal sets.J. T. Baldwin & A. H. Lachlan - 1971 - Journal of Symbolic Logic 36 (1):79-96.
Computable Models of Theories with Few Models.Bakhadyr Khoussainov, Andre Nies & Richard A. Shore - 1997 - Notre Dame Journal of Formal Logic 38 (2):165-178.
Recursively presentable prime models.Leo Harrington - 1974 - Journal of Symbolic Logic 39 (2):305-309.
A New Spectrum of Recursive Models.André Nies - 1999 - Notre Dame Journal of Formal Logic 40 (3):307-314.

Add more references