Prime models and almost decidability

Journal of Symbolic Logic 51 (2):412-420 (1986)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2274064

Other Versions

No versions found

Links

PhilArchive



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

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

Decidability of the "almost all" theory of degrees.John Stillwell - 1972 - Journal of Symbolic Logic 37 (3):501-506.
Prime and atomic models.Julia F. Knight - 1978 - Journal of Symbolic Logic 43 (3):385-393.
Generalized prime models.Robert Fittler - 1971 - Journal of Symbolic Logic 36 (4):593-606.
Recursively presentable prime models.Leo Harrington - 1974 - Journal of Symbolic Logic 39 (2):305-309.
Theories with exactly three countable models and theories with algebraic prime models.Anand Pillay - 1980 - Journal of Symbolic Logic 45 (2):302-310.
Saharon Shelah. On uniqueness of prime models. The journal of symbolic logic, vol. 44 , pp. 215–220.G. L. Cherlin - 1983 - Journal of Symbolic Logic 48 (2):497.
Harrington Leo. Recursively presentable prime models.C. J. Ash - 1984 - Journal of Symbolic Logic 49 (2):671-672.
Atomic models higher up.Jessica Millar & Gerald E. Sacks - 2008 - Annals of Pure and Applied Logic 155 (3):225-241.

Analytics

Added to PP
2009-01-28

Downloads
22 (#984,773)

6 months
14 (#243,699)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Decidability and the number of countable models.Terrence Millar - 1984 - Annals of Pure and Applied Logic 27 (2):137-153.

Add more references