A rather classless model
Author:
Matt Kaufmann
Journal:
Proc. Amer. Math. Soc. 62 (1977), 330-333
MSC:
Primary 02H20
DOI:
https://doi.org/10.1090/S0002-9939-1977-0476498-7
MathSciNet review:
0476498
Full-text PDF
Abstract | References | Similar Articles | Additional Information
Abstract: Using 
, a model 
of Peano arithmetic is constructed which has a unique extension 
to a model of 
-PA, Peano arithmetic with 
-comprehension.
- [1] K. J. Barwise, Admissible sets and structures, Springer-Verlag, Heidelberg, 1975. MR 0424560 (54:12519)
- [2] K. J. Barwise and J. Schlipf, On recursively saturated models of arithmetic, Model Theory and Algebra, Lecture Notes in Math., vol. 498, Springer-Verlag, Berlin, 1976, 42-55. MR 0409172 (53:12934)
- [3] H. J. Keisler, Models with tree structures, Proc. Tarski Sympos., Proc. Sympos. Pure Math., Amer. Math. Soc., Providence, R.I., 1974, pp. 331-348. MR 0357108 (50:9576)
- [4] J. Schlipf, Some hyperelementary aspects of model theory, Doctoral Dissertation, University of Wisconsin, Madison, Wis., 1975.
Retrieve articles in Proceedings of the American Mathematical Society with MSC: 02H20
Retrieve articles in all journals with MSC: 02H20
Additional Information
DOI:
https://doi.org/10.1090/S0002-9939-1977-0476498-7
Keywords:
Recursively saturated model,
Peano arithmetic,
-comprehension,
,
Barwise Compactness Theorem,
Barwise Completeness Theorem,
,
Article copyright:
© Copyright 1977
American Mathematical Society
