Degrees of models with prescribed Scott set

  • Julia F. Knight
Conference paper
Part of the Lecture Notes in Mathematics book series (LNM, volume 1292)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Harrington, Leo, "Building nonstandard models of Peano arithmetic," handwritten notes, 1979.Google Scholar
  2. 2.
    Knight, Julia F., "Effective construction of models," to appear in Proc. of Logic Colloquium '84.Google Scholar
  3. 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.MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Macintyre, Angus, and Marker, David, "Degrees of recursively saturated models," Trans. of the Amer. Math. Soc., vol. 282(1984), pp. 539–554.MathSciNetCrossRefzbMATHGoogle Scholar
  5. 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. 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. 7.
    Solovay, Robert, "Degrees of models of true arithmetic," to appear in Proc. of Logic Colloquium, 1984.Google Scholar

Copyright information

© Springer-Verlag 1987

Authors and Affiliations

  • Julia F. Knight
    • 1
  1. 1.Department of MathematicsUniversity of Notre DameNotre Dame

Personalised recommendations