Stable structures with few substructures

Journal of Symbolic Logic 61 (3):985-1005 (1996)
  Copy   BIBTEX

Abstract

A countable, atomically stable structure U in a finite, relational language has fewer than 2 ω non-isomorphic substructures if and only if U is cellular. An example shows that the finiteness of the language is necessary

Other Versions

No versions found

Links

PhilArchive



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

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

Countable structures of given age.H. D. Macpherson, M. Pouzet & R. E. Woodrow - 1992 - Journal of Symbolic Logic 57 (3):992-1010.
A note on stability spectrum of generic structures.Yuki Anbo & Koichiro Ikeda - 2010 - Mathematical Logic Quarterly 56 (3):257-261.
Ages of Expansions of ω-Categorical Structures.A. Ivanov & K. Majcher - 2007 - Notre Dame Journal of Formal Logic 48 (3):371-380.
Ab initio generic structures which are superstable but not ω-stable.Koichiro Ikeda - 2012 - Archive for Mathematical Logic 51 (1):203-211.
Maximal chains in the fundamental order.Steven Buechler - 1986 - Journal of Symbolic Logic 51 (2):323-326.
Non-isolated types in stable theories.Predrag Tanović - 2007 - Annals of Pure and Applied Logic 145 (1):1-15.

Analytics

Added to PP
2009-01-28

Downloads
53 (#409,721)

6 months
17 (#174,460)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Counting Siblings in Universal Theories.Samuel Braunfeld & Michael C. Laskowski - 2022 - Journal of Symbolic Logic 87 (3):1130-1155.
Mutual algebraicity and cellularity.Samuel Braunfeld & Michael C. Laskowski - 2022 - Archive for Mathematical Logic 61 (5):841-857.

Add more citations

References found in this work

No references found.

Add more references