Bounding Homogeneous Models

Journal of Symbolic Logic 72 (1):305 - 323 (2007)
  Copy   BIBTEX

Abstract

A Turing degree d is homogeneous bounding if every complete decidable (CD) theory has a d-decidable homogeneous model A, i.e., the elementary diagram De (A) has degree d. It follows from results of Macintyre and Marker that every PA degree (i.e., every degree of a complete extension of Peano Arithmetic) is homogeneous bounding. We prove that in fact a degree is homogeneous bounding if and only if it is a PA degree. We do this by showing that there is a single CD theory T such that every homogeneous model of T has a PA degree

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,998

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

Bounding Prime Models.Barbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight & Robert I. Soare - 2004 - Journal of Symbolic Logic 69 (4):1117 - 1142.
A characterization of the 0 -basis homogeneous bounding degrees.Karen Lange - 2010 - Journal of Symbolic Logic 75 (3):971-995.
Computability of Homogeneous Models.Karen Lange & Robert I. Soare - 2007 - Notre Dame Journal of Formal Logic 48 (1):143-170.
On the number of countable homogeneous models.Libo Lo - 1983 - Journal of Symbolic Logic 48 (3):539-541.
Saturation of homogeneous resplendent models.Julia F. Knight - 1986 - Journal of Symbolic Logic 51 (1):222-224.
The degree spectra of homogeneous models.Karen Lange - 2008 - Journal of Symbolic Logic 73 (3):1009-1028.
Morley Rank in Homogeneous Models.Alexei Kolesnikov & G. V. N. G. Krishnamurthi - 2006 - Notre Dame Journal of Formal Logic 47 (3):319-329.
The spectrum of resplendency.John T. Baldwin - 1990 - Journal of Symbolic Logic 55 (2):626-636.

Analytics

Added to PP
2010-08-24

Downloads
48 (#331,676)

6 months
9 (#309,427)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Valentina Harizanov
George Washington University

Citations of this work

The degree spectra of homogeneous models.Karen Lange - 2008 - Journal of Symbolic Logic 73 (3):1009-1028.
Computability of Homogeneous Models.Karen Lange & Robert I. Soare - 2007 - Notre Dame Journal of Formal Logic 48 (1):143-170.

Add more citations

References found in this work

Computable structures and the hyperarithmetical hierarchy.C. J. Ash - 2000 - New York: Elsevier. Edited by J. Knight.
Degrees coded in jumps of orderings.Julia F. Knight - 1986 - Journal of Symbolic Logic 51 (4):1034-1042.
Recursively presentable prime models.Leo Harrington - 1974 - Journal of Symbolic Logic 39 (2):305-309.

View all 11 references / Add more references