Omitting types in set theory and arithmetic

Journal of Symbolic Logic 41 (1):25-32 (1976)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272941

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,314

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Haim Gaifman. Models and types of Peano's arithmetic. Annals of mathematical logic, vol. 9, pp. 223–306. - Julia F. Knight. Omitting types in set theory and arithmetic. The journal of symbolic logic, vol. 41 , pp. 25–32. - Julia F. Knight. Hanf numbers for omitting types over particular theories. The journal of symbolic logic, vol. 41 , pp. 583–588. - Fred G. Abramson and Leo A. Harrington. Models without indiscernibles. The journal of symbolic logic, vol. 41 , vol. 43 , pp. 572–600. [REVIEW]J. P. Ressayre - 1983 - Journal of Symbolic Logic 48 (2):484-485.
Models without indiscernibles.Fred G. Abramson & Leo A. Harrington - 1978 - Journal of Symbolic Logic 43 (3):572-600.
Omitting types: Application to recursion theory.Thomas J. Grilliot - 1972 - Journal of Symbolic Logic 37 (1):81-89.
Thomas J. Grilliot. Omitting types: application to recursion theory. The journal of symbolic logic, vol. 37 , pp. 81–89.Wayne Richter - 1975 - Journal of Symbolic Logic 40 (1):87-88.
Jon Barwise and John Schlipf. On recursively saturated models of arithmetic. Model theory and algebra, A memorial tribute to Abraham Robinson, edited by D. H. Saracino and V. B. Weispfenning, Lecture notes in mathematics, vol. 498, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 42–55. - Patrick Cegielski, Kenneth McAloon, and George Wilmers. Modèles récursivement saturés de l'addition et de la multiplication des entiers naturels. Logic Colloquium '80, Papers intended for the European summer meeting of the Association for Symbolic Logic, edited by D. van Dalen, D. Lascar, and T. J. Smiley, Studies in logic and the foundations of mathematics, vol. 108, North-Holland Publishing Company, Amsterdam, New York, and London, 1982, pp. 57–68. - Julia F. Knight. Theories whose resplendent models are homogeneous. Israel journal of mathematics, vol. 42 , pp. 151–161. - Julia Knight and Mark Nadel. Expansions of models and Turing degrees. The journal of symbolic logic, vol. 47 , pp. 58. [REVIEW]J. -P. Ressayre - 1987 - Journal of Symbolic Logic 52 (1):279-284.
Review: Thomas J. Grilliot, Omitting Types: Application to Recursion Theory. [REVIEW]Wayne Richter - 1975 - Journal of Symbolic Logic 40 (1):87-88.
David Marker. Degrees of models of true arithmetic. Proceedings of the Herbrand Symposium, Logic Colloquium '81, Proceedings of the Herbrand Symposium held in Marseilles, France, July 1981, edited by J. Stern, Studies in logic and the foundations of mathematics, vol. 107, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1982, pp. 233–242. - Julia Knight, Alistair H. Lachlan, and Robert I. Soare. Two theorems on degrees of models of true arithmetic. The journal of symbolic logic, vol. 49 , pp. 425–436. [REVIEW]Terrence S. Millar - 1987 - Journal of Symbolic Logic 52 (2):562-563.
Arithmetic and the theory of types.M. Boffa - 1984 - Journal of Symbolic Logic 49 (2):621-624.

Analytics

Added to PP
2009-01-28

Downloads
64 (#344,708)

6 months
17 (#151,358)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Minimal elementary end extensions.James H. Schmerl - 2017 - Archive for Mathematical Logic 56 (5-6):541-553.

Add more citations

References found in this work

Set Theory and the Continuum Hypothesis.Kenneth Kunen - 1966 - Journal of Symbolic Logic 35 (4):591-592.

Add more references