Recursively saturated nonstandard models of arithmetic; addendum

descriptionPublicationkeyboard_double_arrow_right Article 01 Sep 1982 English Publisher:Cambridge University Press (CUP)Journal:Journal of Symbolic Logic, volume 47, pages 493-494 (issn: 0022-4812, eissn: 1943-5886,

Copyright policy )

Authors: Craig Smorynski;

doi: 10.2307/2273586

Recursively saturated nonstandard models of arithmetic; addendum

- Summary
- Subjects
- Metrics

Abstract

These additions to the author's paper [ibid. 46, 259-286 (1981; Zbl 0501.03044)] rely mainly on unpublished work of several authors. In particular, an argument (due to R. Solovay) is outlined that there are no short cofinally resplendent models.

Keywords

Models of arithmetic and set theory, Nonstandard models of arithmetic, recursively saturated models, Computable structure theory, computable model theory, cofinally resplendent models

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

0

Average

Fields of Science

Fields of Science

Upload OA version

Are you the author of this publication? Upload your Open Access version to Zenodo!

It’s fast and easy, just two clicks!

uploadUpload now