Countable Models of ℵ 1 -Categorical Theories

, &
Journal of Symbolic Logic 40 (4):636-637 (1975)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271858

Links

PhilArchive



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

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

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.
Review: Michael Morley, Countable Models of $aleph_1$-Categorical Theories; J. T. Baldwin, A. H. Lachlan, On Strongly Minimal Sets. [REVIEW]John W. Rosenthal - 1975 - Journal of Symbolic Logic 40 (4):636-637.
Automatic models of first order theories.Pavel Semukhin & Frank Stephan - 2013 - Annals of Pure and Applied Logic 164 (9):837-854.
Tiny models of categorical theories.M. C. Laskowski, A. Pillay & P. Rothmaler - 1992 - Archive for Mathematical Logic 31 (6):385-396.
On omega-categorical simple theories.Daniel Palacín - 2012 - Archive for Mathematical Logic 51 (7-8):709-717.
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.
Model theory without choice? Categoricity.Saharon Shelan - 2009 - Journal of Symbolic Logic 74 (2):361-401.
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.
[Omnibus Review].Ehud Hrushovski - 1993 - Journal of Symbolic Logic 58 (2):710-713.
Rich models.Michael H. Albert & Rami P. Grossberg - 1990 - Journal of Symbolic Logic 55 (3):1292-1298.
Theories with a finite number of countable models.Robert E. Woodrow - 1978 - Journal of Symbolic Logic 43 (3):442-455.
Uncountable theories that are categorical in a higher power.Michael Chris Laskowski - 1988 - Journal of Symbolic Logic 53 (2):512-530.
Countable models of trivial theories which admit finite coding.James Loveys & Predrag Tanović - 1996 - Journal of Symbolic Logic 61 (4):1279-1286.
ℵ0-categorical tree-decomposable structures.A. H. Lachlan - 1992 - Journal of Symbolic Logic 57 (2):501 - 514.

Analytics

Added to PP
2015-02-05

Downloads
12 (#1,062,297)

6 months
5 (#638,139)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Finite diagrams stable in power.Saharon Shelah - 1970 - Annals of Mathematical Logic 2 (1):69-118.
Model theory on admissible sets.Nigel Cutland - 1973 - Annals of Mathematical Logic 5 (4):257.

Add more citations

References found in this work

No references found.

Add more references