Journal of Symbolic Logic

Bounding homogeneous models

Barbara F. Csima, Valentina S. Harizanov, Denis R. Hirschfeldt, and Robert I. Soare

Full-text: Access denied (no subscription detected) We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


A Turing degree d is homogeneous bounding if every complete decidable (CD) theory has a d-decidable homogeneous model 𝒜, i.e., the elementary diagram De(𝒜) 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.

Article information

J. Symbolic Logic Volume 72, Issue 1 (2007), 305-323.

First available in Project Euclid: 23 March 2007

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier


Csima, Barbara F.; Harizanov, Valentina S.; Hirschfeldt, Denis R.; Soare, Robert I. Bounding homogeneous models. J. Symbolic Logic 72 (2007), no. 1, 305--323. doi:10.2178/jsl/1174668397.

Export citation