Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H. Friedman, Countable models of set theories, in Proc. Cambridge Summer School in Logic, Matthias and Rogers eds., Lecture Notes in Mathematics vol. 337, p. 539–573.
D. Guaspari, Partially conservative extensions of arithmetic, Transactions of the AMS.
L.A.S. Kirby, Initial segments of models of arithmetic, thesis, Manchester Univ. 1977.
L.A.S. Kirby, and J.B. Paris, Initial segments of models of Peano’s axioms.
R. Murawski: thesis, Warsaw University 1978.
C. Smoryński, Recursively Saturated Nonstandard Models of Arithmetic.
K. McAloon, Diagonal methods and strong cuts in models of arithmetic, in Logic Colloquium 77, eds. A. Macintyre, L. Pacholski, J. Paris, p. 171–182.
L. Kirby, K. McAloon, R. Murawski: Indicators, recursive saturation and expandability, Fund. Math. (to appear).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag
About this paper
Cite this paper
Hájek, P., Pudlák, P. (1980). Two orderings of the class of all countable models of peano arithmetic. In: Pacholski, L., Wierzejewski, J., Wilkie, A.J. (eds) Model Theory of Algebra and Arithmetic. Lecture Notes in Mathematics, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0090166
Download citation
DOI: https://doi.org/10.1007/BFb0090166
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10269-4
Online ISBN: 978-3-540-38393-2
eBook Packages: Springer Book Archive