Omitting quantifier-free types in generic structures

Journal of Symbolic Logic 37 (3):512-520 (1972)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272737

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

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

Review: G. L. Cherlin, The Model-Companion of a Class of Structures; L. Lipshitz, D. Saracino, The Model Companion of the Theory of Commutative Rings Without Nilpotent Elements; Angus Macintyre, Model-Completeness for Sheaves of Structures. [REVIEW]Stephen D. Comer - 1983 - Journal of Symbolic Logic 48 (2):496-496.
Omitting types in logic of metric structures.Ilijas Farah & Menachem Magidor - 2018 - Journal of Mathematical Logic 18 (2):1850006.
Review: Lou van den Dries, Angus Macintyre, David Marker, The Elementary Theory of Restricted Analytic Fields with Exponentiation; Lou van den Dries, Angus Macintyre, David Marker, Logarithmic-Exponential Power Series. [REVIEW]Chris Miller - 2000 - Bulletin of Symbolic Logic 6 (2):213-216.
G. L. Cherlin. The model-companion of a class of structures. The journal of symbolic logic, vol. 37 , pp. 546–556. - L. Lipshitz and D. Saracino. The model companion of the theory of commutative rings without nilpotent elements. Proceedings of the American Mathematical Society, vol. 38 , pp. 381–387. - Angus Macintyre. Model-completeness for sheaves of structures. Fundamenta mathematicae, vol. 81 no. 1 , pp. 73–89. [REVIEW]Stephen D. Comer - 1983 - Journal of Symbolic Logic 48 (2):496-496.
Review: Peter Aczel, Angus Macintyre, Leszek Pacholski, Jeff Paris, The Type Theoretic Interpretation of Constructive Set Theory. [REVIEW]Wim Veldman - 1984 - Journal of Symbolic Logic 49 (1):313-314.
Omitting types of prenex formulas.C. C. Chang - 1967 - Journal of Symbolic Logic 32 (1):61-74.
Omitting Types of Prenex Formulas.C. C. Chang - 1974 - Journal of Symbolic Logic 39 (1):182-182.
Omitting types: Application to recursion theory.Thomas J. Grilliot - 1972 - Journal of Symbolic Logic 37 (1):81-89.
Omitting Types: Application to Recursion Theory.Thomas J. Grilliot - 1975 - Journal of Symbolic Logic 40 (1):87-88.
Omitting types in set theory and arithmetic.Julia F. Knight - 1976 - Journal of Symbolic Logic 41 (1):25-32.

Analytics

Added to PP
2009-01-28

Downloads
56 (#279,048)

6 months
14 (#252,725)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Computably enumerable sets and quasi-reducibility.R. Downey, G. LaForte & A. Nies - 1998 - Annals of Pure and Applied Logic 95 (1-3):1-35.
Algebraically prime models.J. T. Baldwin - 1981 - Annals of Mathematical Logic 20 (3):289.

View all 6 citations / Add more citations

References found in this work

Model-completions and modules.P. Eklof - 1971 - Annals of Mathematical Logic 2 (3):251.
Completing theories by forcing.J. Barwise - 1970 - Annals of Mathematical Logic 2 (2):119.

Add more references