Skip to main content Accessibility help
  • Print publication year: 2005
  • Online publication date: March 2017

Sequences of degrees associated with models of arithmetic

[1] A., Arana, Solovay's Theorem cannot be simplified, Annals of Pure and Applied Logic, vol. 112 (2001), pp. 27–41.
[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.
[3] C. J., Ash and J. F., Knight, Ramified systems, Annals of Pure and Applied Logic, vol. 70 (1994), pp. 205–221.
[4] C. J., Ash, Coding a family of sets, Annals of Pure and Applied Logic, vol. 94 (1998), pp. 127–142.
[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.
[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.
[10] D., Scott, Algebras of sets binumerable in complete extensions of arithmetic, Recursive function theory (Dekker, editor), AmericanMathematical Society, 1962, pp. 117–122.