Computable Models of Theories with Few Models

Notre Dame Journal of Formal Logic 38 (2):165-178 (1997)
  Copy   BIBTEX


In this paper we investigate computable models of -categorical theories and Ehrenfeucht theories. For instance, we give an example of an -categorical but not -categorical theory such that all the countable models of except its prime model have computable presentations. We also show that there exists an -categorical but not -categorical theory such that all the countable models of except the saturated model, have computable presentations



    Upload a copy of this work     Papers currently archived: 86,336

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


Added to PP

30 (#438,555)

6 months
1 (#865,432)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Computable Abelian groups.Alexander G. Melnikov - 2014 - Bulletin of Symbolic Logic 20 (3):315-356,.
On Δ 2 0 -categoricity of equivalence relations.Rod Downey, Alexander G. Melnikov & Keng Meng Ng - 2015 - Annals of Pure and Applied Logic 166 (9):851-880.
Scott sentences for equivalence structures.Sara B. Quinn - 2020 - Archive for Mathematical Logic 59 (3-4):453-460.

View all 27 citations / Add more citations

References found in this work

On strongly minimal sets.J. T. Baldwin & A. H. Lachlan - 1971 - Journal of Symbolic Logic 36 (1):79-96.
Recursively presentable prime models.Leo Harrington - 1974 - Journal of Symbolic Logic 39 (2):305-309.
Recursively Presentable Prime Models.Leo Harrington & Terrence S. Millar - 1984 - Journal of Symbolic Logic 49 (2):671-672.

Add more references