Omitting types, type spectrums, and decidability

Journal of Symbolic Logic 48 (1):171-181 (1983)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273331

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,053

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

Omitting types in incomplete theories.Enrique Casanovas & Rafel Farré - 1996 - Journal of Symbolic Logic 61 (1):236-245.
Omitting types in logic of metric structures.Ilijas Farah & Menachem Magidor - 2018 - Journal of Mathematical Logic 18 (2):1850006.
Omitting types of prenex formulas.C. C. Chang - 1967 - Journal of Symbolic Logic 32 (1):61-74.
Omitting types: Application to recursion theory.Thomas J. Grilliot - 1972 - Journal of Symbolic Logic 37 (1):81-89.
Omitting types in set theory and arithmetic.Julia F. Knight - 1976 - Journal of Symbolic Logic 41 (1):25-32.
Omitting types for stable CCC theories.Ludomir Newelski - 1990 - Journal of Symbolic Logic 55 (3):1037-1047.
Omitting types in o-minimal theories.David Marker - 1986 - Journal of Symbolic Logic 51 (1):63-74.

Analytics

Added to PP
2009-01-28

Downloads
45 (#472,050)

6 months
14 (#205,100)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Computability of Homogeneous Models.Karen Lange & Robert I. Soare - 2007 - Notre Dame Journal of Formal Logic 48 (1):143-170.
Decidability and the number of countable models.Terrence Millar - 1984 - Annals of Pure and Applied Logic 27 (2):137-153.

Add more citations

References found in this work

Model Theory.Michael Makkai, C. C. Chang & H. J. Keisler - 1991 - Journal of Symbolic Logic 56 (3):1096.
Foundations of recursive model theory.Terrence S. Millar - 1978 - Annals of Mathematical Logic 13 (1):45.

Add more references