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 [Book Review]

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

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,612

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Simple groups and the number of countable models.Predrag Tanović - 2013 - Archive for Mathematical Logic 52 (7-8):779-791.
Superstable theories with few countable models.Lee Fong Low & Anand Pillay - 1992 - Archive for Mathematical Logic 31 (6):457-465.
Vaught’s conjecture for superstable theories of finite rank.Steven Buechler - 2008 - Annals of Pure and Applied Logic 155 (3):135-172.
A decidable Ehrenfeucht theory with exactly two hyperarithmetic models.Robert C. Reed - 1991 - Annals of Pure and Applied Logic 53 (2):135-168.
Non-isolated types in stable theories.Predrag Tanović - 2007 - Annals of Pure and Applied Logic 145 (1):1-15.

Analytics

Added to PP
2013-11-22

Downloads
1 (#1,722,932)

6 months
1 (#1,912,481)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references