Skip to main content

Degrees of models with prescribed Scott set

Part of the Lecture Notes in Mathematics book series (LNM,volume 1292)

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

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Harrington, Leo, "Building nonstandard models of Peano arithmetic," handwritten notes, 1979.

    Google Scholar 

  2. Knight, Julia F., "Effective construction of models," to appear in Proc. of Logic Colloquium '84.

    Google Scholar 

  3. 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.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. Macintyre, Angus, and Marker, David, "Degrees of recursively saturated models," Trans. of the Amer. Math. Soc., vol. 282(1984), pp. 539–554.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. 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.

    Google Scholar 

  6. 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.

    Google Scholar 

  7. Solovay, Robert, "Degrees of models of true arithmetic," to appear in Proc. of Logic Colloquium, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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