Theories Having Finitely Many Countable Homogeneous Models

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 32 (7-9):131-131 (1986)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19860320705

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,953

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

Theories Having Finitely Many Countable Homogeneous Models.James H. Schmerl - 1986 - Mathematical Logic Quarterly 32 (7‐9):131-131.
Finitely generated submodels of an uncountably categorical homogeneous structure.Tapani Hyttinen - 2004 - Mathematical Logic Quarterly 50 (1):77.
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.
On countable homogeneous 3-hypergraphs.Reza Akhtar & Alistair H. Lachlan - 1995 - Archive for Mathematical Logic 34 (5):331-344.
On Vaught’s Conjecture and finitely valued MV algebras.Antonio Di Nola & Giacomo Lenzi - 2012 - Mathematical Logic Quarterly 58 (3):139-152.
Review: A. H. Lachlan, On Countable Stable Structures which are Homogeneous for a Finite Relational Language; G. Cherlin, A. H. Lachlan, Stable Finitely Homogeneous Structures. [REVIEW]Dugald Macpherson - 1993 - Journal of Symbolic Logic 58 (1):350-352.
Uncountable Homogeneous Partial Orders.Manfred Droste, Dugald Macpherson & Alan Mekler - 2002 - Mathematical Logic Quarterly 48 (4):525-532.
The complexity of classification problems for models of arithmetic.Samuel Coskey & Roman Kossak - 2010 - Bulletin of Symbolic Logic 16 (3):345-358.
Theories with a finite number of countable models.Robert E. Woodrow - 1978 - Journal of Symbolic Logic 43 (3):442-455.
Reducts of random hypergraphs.Simon Thomas - 1996 - Annals of Pure and Applied Logic 80 (2):165-193.
Countable models of trivial theories which admit finite coding.James Loveys & Predrag Tanović - 1996 - Journal of Symbolic Logic 61 (4):1279-1286.
A. H. Lachlan. On countable stable structures which are homogeneous for a finite relational language. Israel journal of mathematics, vol. 49 , pp. 69–153. - G. Cherlin and A. H. Lachlan. Stable finitely homogeneous structures. Transactions of the American Mathematical Society, vol. 296 , pp. 815–850. [REVIEW]Dugald Macpherson - 1993 - Journal of Symbolic Logic 58 (1):350-352.
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.
Superstable theories with few countable models.Lee Fong Low & Anand Pillay - 1992 - Archive for Mathematical Logic 31 (6):457-465.
The degree spectra of homogeneous models.Karen Lange - 2008 - Journal of Symbolic Logic 73 (3):1009-1028.

Analytics

Added to PP
2015-12-02

Downloads
25 (#653,077)

6 months
5 (#710,646)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Model Theory.Gebhard Fuhrken - 1976 - Journal of Symbolic Logic 41 (3):697-699.

Add more references