Keywords
- Effective Enumeration
- Peano Arithmetic
- Open Sentence
- Turing Degree
- Complete Diagram
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Harrington, Leo, "Building nonstandard models of Peano arithmetic," handwritten notes, 1979.
Knight, Julia F., "Effective construction of models," to appear in Proc. of Logic Colloquium '84.
Knight, Julia F., Lachlan, Alistair, and Soare, Robert, "Two theorems on degrees of models of true arithmetic," J. Symb. Logic, vol. 49(1984), pp. 425–436.
Macintyre, Angus, and Marker, David, "Degrees of recursively saturated models," Trans. of the Amer. Math. Soc., vol. 282(1984), pp. 539–554.
Marker, David, "Degrees of models of true arithmetic," Proc. of the Herbrand Symp.: Logic Colloquium, 1981, ed. by Stern, North-Holland, Amsterdam, pp. 233–242.
Dana, Scott, "Algebras of sets binumerable in complete extensions of arithmetic," Recursive Function Theory: Proc. of Symp. in Pure Math., vol. 5, Amer. Math. Soc., Providence, 1961, pp. 117–121.
Solovay, Robert, "Degrees of models of true arithmetic," to appear in Proc. of Logic Colloquium, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag
About this paper
Cite this paper
Knight, J.F. (1987). Degrees of models with prescribed Scott set. In: Baldwin, J.T. (eds) Classification Theory. Lecture Notes in Mathematics, vol 1292. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0082238
Download citation
DOI: https://doi.org/10.1007/BFb0082238
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18674-8
Online ISBN: 978-3-540-48049-5
eBook Packages: Springer Book Archive
