Skip to main content Accessibility help
×
Home

Prime models of computably enumerable degree

  • Rachel Epstein (a1)

Abstract

We examine the computably enumerable (c.e.) degrees of prime models of complete atomic decidable (CAD) theories. A structure has degree d if d is the degree of its elementary diagram. We show that if a CAD theory T has a prime model of c.e. degree c, then T has a prime model of strictly lower c.e. degree b, where, in addition, b is low (b′ = 0′), This extends Csima's result that every CAD theory has a low prime model. We also prove a density result for c.e. degrees of prime models. In particular, if c and d are c.e. degrees with d < c and c not low2 (c″ > 0″), then for any CAD theory T, there exists a c.e. degree b with d < b < c such that T has a prime model of degree b, where b can be chosen so that b′ is any degree c.e. in c with d′ ≤ b′. As a corollary, we show that for any degree c with 0 < c < 0′, every CAD theory has a prime model of low c.e. degree incomparable with c. We show also that every CAD theory has prime models of low c.e. degree that form a minimal pair, extending another result of Csima. We then discuss how these results apply to homogeneous models.

Copyright

References

Hide All
Csima, B. F. [2004], Degree spectra of prime models, this Journal, vol. 69, pp. 430442.
Csima, B. F., Hirschfeldt, D. R., Knight, J. F., and Soare, R. I. [2004], Bounding prime models, this Journal, vol. 69, pp. 11171142.
Goncharov, S. S. [1978], Strong constructivizability of homogeneous models (Russian), Algebra i Logika, vol. 17, pp. 363388; translated in Algebra and Logic, vol. 17 (1978), pp. 247–263.
Goncharov, S. S. and Nurtazin, A. T. [1973], Constructive models of complete decidable theories, Algebra and Logic, vol. 12, pp. 6777, (English translation).
Harrington, L. [1974], Recursively presentable prime models, this Journal, vol. 39, pp. 305309.
Harrington, L. and Soare, R. I. [1992], Games in recursion theory and continuity properties of capping degrees, Set theory of the continuum (Judah, H., Just, W., and Woodin, H., editors), Springer-Verlag, New York, pp. 3962.
Hirschfeldt, D. R. [2006], Computable trees, prime models, and relative decidability, Proceedings of the American Mathematical Society, vol. 134, pp. 14951498.
Knight, J. F. [1986], Degrees coded in jumps of orderings, this Journal, vol. 51, pp. 10341042.
Lachlan, A. H. [1966], Lower bounds for pairs of recursively enumerable degrees, Proceedings of the London Mathematical Society, vol. 16, pp. 537769.
Lange, K. [2008], The degree spectra of homogeneous models, this Journal, vol. 73, pp. 10091028.
Lange, K. [ip]. The reverse mathematics of homogeneous models, in preparation.
Martin, D. A. [1966], Classes of recursively enumerable sets and degrees of unsolvability, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 12, pp. 295310.

Related content

Powered by UNSILO

Prime models of computably enumerable degree

  • Rachel Epstein (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.