Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

Bounding Prime Models

Barbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight and Robert I. Soare
The Journal of Symbolic Logic
Vol. 69, No. 4 (Dec., 2004), pp. 1117-1142
Stable URL: http://www.jstor.org/stable/30041779
Page Count: 26
  • Read Online (Free)
  • Download ($10.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Bounding Prime Models
Preview not available

Abstract

A set X is prime bounding if for every complete atomic decidable (CAD) theory T there is a prime model U of T decidable in X. It is easy to see that $X = 0\prime$ is prime bounding. Denisov claimed that every $X <_{T} 0\prime$ is not prime bounding, but we discovered this to be incorrect. Here we give the correct characterization that the prime bounding sets $X \leq_{T} 0\prime$ are exactly the sets which are not $low_2$. Recall that X is $low_2$ if $X\prime\prime$ $\leq_{T} 0\prime$. To prove that a $low_2$ set X is not prime bounding we use a $0\prime$-computable listing of the array of sets { Y : Y $\leq_{T}$ X } to build a CAD theory T which diagonalizes against all potential X-decidable prime models U of T. To prove that any $non-low_{2}$; X is indeed prime bounding, we fix a function f $\leq_T$ X that is not dominated by a certain $0\prime$-computable function that picks out generators of principal types. Given a CAD theory T. we use f to eventually find, for every formula $\varphi (\bar{x})$ consistent with T, a principal type which contains it, and hence to build an X-decidable prime model of T. We prove the prime bounding property equivalent to several other combinatorial properties, including some related to the limitwise monotonic functions which have been introduced elsewhere in computable model theory.

Page Thumbnails

  • Thumbnail: Page 
1117
    1117
  • Thumbnail: Page 
1118
    1118
  • Thumbnail: Page 
1119
    1119
  • Thumbnail: Page 
1120
    1120
  • Thumbnail: Page 
1121
    1121
  • Thumbnail: Page 
1122
    1122
  • Thumbnail: Page 
1123
    1123
  • Thumbnail: Page 
1124
    1124
  • Thumbnail: Page 
1125
    1125
  • Thumbnail: Page 
1126
    1126
  • Thumbnail: Page 
1127
    1127
  • Thumbnail: Page 
1128
    1128
  • Thumbnail: Page 
1129
    1129
  • Thumbnail: Page 
1130
    1130
  • Thumbnail: Page 
1131
    1131
  • Thumbnail: Page 
1132
    1132
  • Thumbnail: Page 
1133
    1133
  • Thumbnail: Page 
1134
    1134
  • Thumbnail: Page 
1135
    1135
  • Thumbnail: Page 
1136
    1136
  • Thumbnail: Page 
1137
    1137
  • Thumbnail: Page 
1138
    1138
  • Thumbnail: Page 
1139
    1139
  • Thumbnail: Page 
1140
    1140
  • Thumbnail: Page 
1141
    1141
  • Thumbnail: Page 
1142
    1142