Notre Dame Journal of Formal Logic 48 (1):143-170 (2007)

Abstract
In the last five years there have been a number of results about the computable content of the prime, saturated, or homogeneous models of a complete decidable theory T in the spirit of Vaught's "Denumerable models of complete theories" combined with computability methods for degrees d ≤ 0′. First we recast older results by Goncharov, Peretyat'kin, and Millar in a more modern framework which we then apply. Then we survey recent results by Lange, "The degree spectra of homogeneous models," which generalize the older results and which include positive results on when a certain homogeneous model of T has an isomorphic copy of a given Turing degree. We then survey Lange's "A characterization of the 0-basis homogeneous bounding degrees" for negative results about when does not have such copies, generalizing negative results by Goncharov, Peretyat'kin, and Millar. Finally, we explain recent results by Csima, Harizanov, Hirschfeldt, and Soare, "Bounding homogeneous models," about degrees d that are homogeneous bounding and explain their relation to the PA degrees
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1305/ndjfl/1172787551
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 53,682
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Degrees Coded in Jumps of Orderings.Julia F. Knight - 1986 - Journal of Symbolic Logic 51 (4):1034-1042.
The -Spectrum of a Linear Order.Russell Miller - 2001 - Journal of Symbolic Logic 66 (2):470-486.
Recursively Presentable Prime Models.Leo Harrington - 1974 - Journal of Symbolic Logic 39 (2):305-309.

View all 8 references / Add more references

Citations of this work BETA

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.
A Characterization of the 0 -Basis Homogeneous Bounding Degrees.Karen Lange - 2010 - Journal of Symbolic Logic 75 (3):971-995.
The Degree Spectra of Homogeneous Models.Karen Lange - 2008 - Journal of Symbolic Logic 73 (3):1009-1028.

Add more citations

Similar books and articles

The Degree Spectra of Homogeneous Models.Karen Lange - 2008 - Journal of Symbolic Logic 73 (3):1009-1028.
Computability and Recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
A Characterization of the 0 -Basis Homogeneous Bounding Degrees.Karen Lange - 2010 - Journal of Symbolic Logic 75 (3):971-995.
On the Number of Countable Homogeneous Models.Libo Lo - 1983 - Journal of Symbolic Logic 48 (3):539-541.
Remarks on the Development of Computability.Stewart Shapiro - 1983 - History and Philosophy of Logic 4 (1-2):203-220.
Saturation of Homogeneous Resplendent Models.Julia F. Knight - 1986 - Journal of Symbolic Logic 51 (1):222-224.
Computability and Randomness.André Nies - 2008 - Oxford University Press.
Morley Rank in Homogeneous Models.Alexei Kolesnikov & G. V. N. G. Krishnamurthi - 2006 - Notre Dame Journal of Formal Logic 47 (3):319-329.

Analytics

Added to PP index
2010-08-24

Total views
19 ( #517,440 of 2,349,384 )

Recent downloads (6 months)
1 ( #510,581 of 2,349,384 )

How can I increase my downloads?

Downloads

My notes