On the Number of Countable Models of a Countable Superstable Theory

Journal of Symbolic Logic 47 (1):215-217 (1982)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273397

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,440

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: A. H. Lachlan, Patrick Suppes, On the Number of Countable Models of a Countable Superstable Theory; Daniel Lascar, Ranks and Definability in Superstable Theories. [REVIEW]Terrence Millar - 1982 - Journal of Symbolic Logic 47 (1):215-217.
Superstable theories with few countable models.Lee Fong Low & Anand Pillay - 1992 - Archive for Mathematical Logic 31 (6):457-465.
Simple groups and the number of countable models.Predrag Tanović - 2013 - Archive for Mathematical Logic 52 (7-8):779-791.
A decidable Ehrenfeucht theory with exactly two hyperarithmetic models.Robert C. Reed - 1991 - Annals of Pure and Applied Logic 53 (2):135-168.
A complicated ω-stable depth 2 theory.Martin Koerwien - 2011 - Journal of Symbolic Logic 76 (1):47 - 65.
Constructing strongly equivalent nonisomorphic models for unstable theories.Tapani Hyttinen & Heikki Tuuri - 1991 - Annals of Pure and Applied Logic 52 (3):203-248.
Non-isolated types in stable theories.Predrag Tanović - 2007 - Annals of Pure and Applied Logic 145 (1):1-15.
Vaught’s conjecture for superstable theories of finite rank.Steven Buechler - 2008 - Annals of Pure and Applied Logic 155 (3):135-172.
The spectrum of resplendency.John T. Baldwin - 1990 - Journal of Symbolic Logic 55 (2):626-636.
End extensions and numbers of countable models.Saharon Shelah - 1978 - Journal of Symbolic Logic 43 (3):550-562.
Countable models of trivial theories which admit finite coding.James Loveys & Predrag Tanović - 1996 - Journal of Symbolic Logic 61 (4):1279-1286.
Theories with a finite number of countable models.Robert E. Woodrow - 1978 - Journal of Symbolic Logic 43 (3):442-455.
Order types of ordinals in models of set theory.John E. Hutchinson - 1976 - Journal of Symbolic Logic 41 (2):489-502.
Rich models.Michael H. Albert & Rami P. Grossberg - 1990 - Journal of Symbolic Logic 55 (3):1292-1298.
Countable Fréchetα 1-spaces may be first countable.Alan Dow & Juris Stepräns - 1992 - Archive for Mathematical Logic 32 (1):33-50.

Analytics

Added to PP
2015-02-05

Downloads
9 (#1,232,561)

6 months
2 (#1,229,212)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

From stability to simplicity.Byunghan Kim & Anand Pillay - 1998 - Bulletin of Symbolic Logic 4 (1):17-36.
On Martin's conjecture.C. M. Wagner - 1982 - Annals of Mathematical Logic 22 (1):47.

Add more citations

References found in this work

No references found.

Add more references