Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-26T05:53:03.776Z Has data issue: false hasContentIssue false

Sequences of degrees associated with models of arithmetic

from ARTICLES

Published online by Cambridge University Press:  31 March 2017

By
Julia F. Knight
Edited by
Matthias Baaz ,
Sy-David Friedman  and
Jan Krajíček
Matthias Baaz
Affiliation:
Technische Universität Wien, Austria
Sy-David Friedman
Affiliation:
Universität Wien, Austria
Jan Krajíček
Affiliation:
Academy of Sciences of the Czech Republic, Prague
Get access
Type
Chapter
Information
Logic Colloquium '01 , pp. 217 - 241
Publisher: Cambridge University Press
Print publication year: 2005

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] A., Arana, Solovay's Theorem cannot be simplified, Annals of Pure and Applied Logic, vol. 112 (2001), pp. 27–41.Google Scholar
[2] C. J., Ash, Recursive labeling systems and stability of recursive structures in hyperarithmetical degrees, Transactions of the American Mathematical Society, vol. 298 (1986), pp. 497–514, Corrections, ibid, vol. 310 (1988), p. 851.Google Scholar
[3] C. J., Ash and J. F., Knight, Ramified systems, Annals of Pure and Applied Logic, vol. 70 (1994), pp. 205–221.Google Scholar
[4] C. J., Ash, Coding a family of sets, Annals of Pure and Applied Logic, vol. 94 (1998), pp. 127–142.Google Scholar
[5] C. J., Ash, Computable structures and the hyperarithmetical hierarchy, Elsevier, 2000.
[6] V. S., Harizanov, J. F., Knight, and A. S., Morozov, Sequences of n-diagrams, The Journal of Symbolic Logic, vol. 67 (2002), pp. 1227–1247.Google Scholar
[7] J. F., Knight, True approximations and models of arithmetic, Models and computability (B., Cooper and J., Truss, editors), Cambridge University Press, 1999, pp. 255–278.
[8] J. F., Knight, Models of arithmetic: quantifiers and complexity, Reverse mathematics (S., Simpson, editor), Lecture Notes in Logic, vol. 21, AK Peters, to appear.
[9] A., Macintyre and D., Marker, Degrees of recursively saturated models, Transactions of the American Mathematicsl Society, vol. 282 (1984), pp. 539–554.Google Scholar
[10] D., Scott, Algebras of sets binumerable in complete extensions of arithmetic, Recursive function theory (Dekker, editor), AmericanMathematical Society, 1962, pp. 117–122.

Save book to Kindle

To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×