Decidability and the number of countable models

Annals of Pure and Applied Logic 27 (2):137-153 (1984)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,290

External links

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

Through your library

Similar books and articles

A decidable Ehrenfeucht theory with exactly two hyperarithmetic models.Robert C. Reed - 1991 - Annals of Pure and Applied Logic 53 (2):135-168.
Types directed by constants.Predrag Tanović - 2010 - Annals of Pure and Applied Logic 161 (7):944-955.
Stable theories, pseudoplanes and the number of countable models.Anand Pillay - 1989 - Annals of Pure and Applied Logic 43 (2):147-160.
Decidability questions for a ring of Laurent polynomials.Alla Sirokofskich - 2012 - Annals of Pure and Applied Logic 163 (5):615-619.
Recursive coloration of countable graphs.Hans-Georg Carstens & Peter Päppinghaus - 1983 - Annals of Pure and Applied Logic 25 (1):19-45.
Number of strongly ℵε-saturated models—an addition.Saharon Shelah - 1988 - Annals of Pure and Applied Logic 40 (1):89-91.

Analytics

Added to PP
2014-01-16

Downloads
22 (#960,294)

6 months
11 (#322,218)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Prime models and almost decidability.Terrence Millar - 1986 - Journal of Symbolic Logic 51 (2):412-420.
Bad models in nice neighborhoods.Terry Millar - 1986 - Journal of Symbolic Logic 51 (4):1043-1055.

Add more citations

References found in this work

Omitting types, type spectrums, and decidability.Terrence Millar - 1983 - Journal of Symbolic Logic 48 (1):171-181.

Add more references