David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Notre Dame Journal of Formal Logic 48 (1):143-170 (2007)
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)|
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
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Karen Lange (2008). The Degree Spectra of Homogeneous Models. Journal of Symbolic Logic 73 (3):1009-1028.
Barbara F. Csima, Valentina S. Harizanov, Denis R. Hirschfeldt & Robert I. Soare (2007). Bounding Homogeneous Models. Journal of Symbolic Logic 72 (1):305 - 323.
Robert I. Soare (1996). Computability and Recursion. Bulletin of Symbolic Logic 2 (3):284-321.
J. Baldwin & S. Shelah (1995). Abstract Classes with Few Models Have `Homogeneous-Universal' Models. Journal of Symbolic Logic 60 (1):246-265.
Tapani Hyttinen & Olivier Lessmann (2002). A Rank for the Class of Elementary Submodels of a Superstable Homogeneous Model. Journal of Symbolic Logic 67 (4):1469-1482.
Karen Lange (2010). A Characterization of the 0 -Basis Homogeneous Bounding Degrees. Journal of Symbolic Logic 75 (3):971-995.
S. B. Cooper & J. K. Truss (eds.) (1999). Models and Computability: Invited Papers From Logic Colloquium '97, European Meeting of the Association for Symbolic Logic, Leeds, July 1997. Cambridge University Press.
Tapani Hyttinen & Saharon Shelah (2001). Main Gap for Locally Saturated Elementary Submodels of a Homogeneous Structure. Journal of Symbolic Logic 66 (3):1286-1302.
Libo Lo (1983). On the Number of Countable Homogeneous Models. Journal of Symbolic Logic 48 (3):539-541.
Stewart Shapiro (1983). Remarks on the Development of Computability. History and Philosophy of Logic 4 (1-2):203-220.
Julia F. Knight (1986). Saturation of Homogeneous Resplendent Models. Journal of Symbolic Logic 51 (1):222-224.
Alexei Kolesnikov & G. V. N. G. Krishnamurthi (2006). Morley Rank in Homogeneous Models. Notre Dame Journal of Formal Logic 47 (3):319-329.
Herbert B. Enderton (2011). Computability Theory: An Introduction to Recursion Theory. Academic Press.
Tapani Hyttinen (2003). Interpreting Groups Inside Modular Strongly Minimal Homogeneous Models. Journal of Mathematical Logic 3 (01):127-142.
Sorry, there are not enough data points to plot this chart.
Added to index2010-08-24
Total downloads1 ( #514,100 of 1,692,220 )
Recent downloads (6 months)1 ( #184,284 of 1,692,220 )
How can I increase my downloads?