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] Jon Barwise, Admissible sets and structures, Springer-Verlag, Berlin-New York, 1975. An approach to definability theory; Perspectives in Mathematical Logic. MR 0424560
- [2] Jon Barwise and John Schlipf, On recursively saturated models of arithmetic, Model theory and algebra (A memorial tribute to Abraham Robinson), Springer, Berlin, 1975, pp. 42–55. Lecture Notes in Math., Vol. 498. MR 0409172
- [3] H. Jerome Keisler, Models with tree structures, Proceedings of the Tarski Symposium (Proc. Sympos. Pure Math., Vol. XXV, Univ. California, Berkeley, Calif., 1971) Amer. Math. Soc., Providence, R.I., 1974, pp. 331–348. MR 0357108
- [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
