Some Theories Having Countably Many Countable Models

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 23 (7-12):105-110 (1977)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19770230703

Links

PhilArchive



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

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

Some Theories Having Countably Many Countable Models.Nigel J. Cutland - 1976 - Mathematical Logic Quarterly 23 (7‐12):105-110.
Automatic models of first order theories.Pavel Semukhin & Frank Stephan - 2013 - Annals of Pure and Applied Logic 164 (9):837-854.
Vaught’s conjecture for superstable theories of finite rank.Steven Buechler - 2008 - Annals of Pure and Applied Logic 155 (3):135-172.
Superstable theories with few countable models.Lee Fong Low & Anand Pillay - 1992 - Archive for Mathematical Logic 31 (6):457-465.
Countably-categorical Boolean algebras with distinguished ideals.D. E. Pal'chunov - 1987 - Studia Logica 46 (2):121 - 135.
A note on countable complete theories having three isomorphism types of countable models.Robert E. Woodrow - 1976 - Journal of Symbolic Logic 41 (3):672-680.
[Omnibus Review].Ehud Hrushovski - 1993 - Journal of Symbolic Logic 58 (2):710-713.
U-Meager sets when the cofinality and the coinitiality of U are uncountable.Bosko Zivaljevic - 1991 - Journal of Symbolic Logic 56 (3):906-914.
The complexity of countable categoricity in finite languages.Aleksander Ivanov - 2012 - Mathematical Logic Quarterly 58 (1-2):105-112.
Theories with a finite number of countable models.Robert E. Woodrow - 1978 - Journal of Symbolic Logic 43 (3):442-455.
Computable Models of Theories with Few Models.Bakhadyr Khoussainov, Andre Nies & Richard A. Shore - 1997 - Notre Dame Journal of Formal Logic 38 (2):165-178.
Countable models of trivial theories which admit finite coding.James Loveys & Predrag Tanović - 1996 - Journal of Symbolic Logic 61 (4):1279-1286.
Theories with constants and three countable models.Predrag Tanović - 2007 - Archive for Mathematical Logic 46 (5-6):517-527.
A note on countable models of 1-based theories.Predrag Tanovic - 2002 - Archive for Mathematical Logic 41 (7):669-671.
A complicated ω-stable depth 2 theory.Martin Koerwien - 2011 - Journal of Symbolic Logic 76 (1):47 - 65.

Analytics

Added to PP
2016-02-04

Downloads
17 (#843,162)

6 months
1 (#1,533,009)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Separable models of randomizations.Uri Andrews & H. Jerome Keisler - 2015 - Journal of Symbolic Logic 80 (4):1149-1181.

Add more citations

References found in this work

Model Theory.Michael Makkai, C. C. Chang & H. J. Keisler - 1991 - Journal of Symbolic Logic 56 (3):1096.
Model Theory.Gebhard Fuhrken - 1976 - Journal of Symbolic Logic 41 (3):697-699.

Add more references