Binary Relational Structures Having Only Countably Many Nonisomorphic Substructures

&
Journal of Symbolic Logic 56 (3):876-884 (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2275056

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,486

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

Countable structures of given age.H. D. Macpherson, M. Pouzet & R. E. Woodrow - 1992 - Journal of Symbolic Logic 57 (3):992-1010.
Relational structures determined by their finite induced substructures.I. M. Hodkinson & H. D. Macpherson - 1988 - Journal of Symbolic Logic 53 (1):222-230.
Complete theories with countably many rigid nonisomorphic models.Jerome Malitz - 1975 - Journal of Symbolic Logic 40 (3):389-392.
James H. Schmerl. Peano models with many generic classes. Pacific Journal of Mathematics, vol. 43 (1973), pp. 523–536. - James H. Schmerl. Correction to: “Peano models with many generic classes”. Pacific Journal of Mathematics, vol. 92 (1981), no. 1, pp. 195–198. - James H. Schmerl. Recursively saturated, rather classless models of Peano arithmetic. Logic Year 1979–80. Recursively saturated, rather classless models of Peano arithmetic. Logic Year 1979–80 (Proceedings, Seminars, and Conferences in Mathematical Logic, University of Connecticut, Storrs, Connecticut, 1979/80). edited by M. Lerman, J. H. Schmerl, and R. I. Soare, Lecture Notes in Mathematics, vol. 859. Springer, Berlin, pp. 268–282. - James H. Schmerl. Recursively saturatedmodels generated by indiscernibles. Notre Dane Journal of Formal Logic, vol. 26 (1985), no. 1, pp. 99–105. - James H. Schmerl. Large resplendent models generated by indiscernibles. The Journal of Symbolic Logic, vol. 54 (1989), no. 4, pp. 1382–1388. - Jam. [REVIEW]Roman Kossak - 2009 - Bulletin of Symbolic Logic 15 (2):222-227.
Automorphisms of first-order structures, edited by Richard Kaye and Dugald Macpherson, Clarendon Press, Oxford University Press, Oxford and New York1994, xiv + 386 pp. [REVIEW]Gregory Cherlin - 1996 - Journal of Symbolic Logic 61 (3):1045-1048.
Stable structures with few substructures.Michael Laskowski & Laura Mayer - 1996 - Journal of Symbolic Logic 61 (3):985-1005.
J. H. Schmerl, Subsets coded in elementary end extensions. Archive for Mathematical Logic, vol. 53 (2014), no. 5–6, pp. 571–581. - J. H. Schmerl, Minimal elementary end extensions. Archive for Mathematical Logic, vol. 56 (2017), no. 5–6, pp. 541–553. [REVIEW]Athar Abdul-Quader - 2019 - Bulletin of Symbolic Logic 25 (1):125-126.
On theories having a finite number of nonisomorphic countable models.Akito Tsuboi - 1985 - Journal of Symbolic Logic 50 (3):806-808.
Kolmogorov complexity and symmetric relational structures.W. L. Fouche & P. H. Potgieter - 1998 - Journal of Symbolic Logic 63 (3):1083-1094.
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.

Analytics

Added to PP
2009-01-28

Downloads
66 (#337,062)

6 months
12 (#239,387)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Linear Orderings.Joseph G. Rosenstein - 1983 - Journal of Symbolic Logic 48 (4):1207-1209.

Add more references