Infinite imprimitive homogeneous 3-edge-colored complete graphs

Journal of Symbolic Logic 64 (1):159-179 (1999)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2586757

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,733

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

Two cardinal properties of homogeneous graphs.Gregory Cherlin & Simon Thomas - 2002 - Journal of Symbolic Logic 67 (1):217-220.
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.
Some natural decision problems in automatic graphs.Dietrich Kuske & Markus Lohrey - 2010 - Journal of Symbolic Logic 75 (2):678-710.
Metrically homogeneous graphs of diameter 3.Daniela A. Amato, Gregory Cherlin & H. Dugald Macpherson - 2021 - Journal of Mathematical Logic 21 (1):2050020.
Finite Homogeneous 3‐Graphs.Alistair H. Lachlan & Allyson Tripp - 1995 - Mathematical Logic Quarterly 41 (3):287-306.
C. Berline and G. Cherlin. QE rings in characteristic p. Logic year 1979–80, The University of Connecticut, USA, edited by M. Lerman, J. H. Schmerl, and R. I. Soare, Lecture notes in mathematics, vol. 859, Springer-Verlag, Berlin, Heidelberg, and New York, 1981, pp. 16–31. - C. Berline and G. Cherlin. QE nilrings of prime characteristic. Bulletin de la Société Mathématique de Belgique, ser. B vol. 33 , pp. 3–17. - Chantal Berline and Gregory Cherlin. QE rings in characteristic pn. The journal of symbolic logic, vol. 48 , pp. 140–162. - D. Saracino and C. Wood. QE commutative nilrings. The journal of symbolic logic, vol. 49 , pp. 644–651. [REVIEW]M. Boffa - 1985 - Journal of Symbolic Logic 50 (4):1080-1081.
Gregory Cherlin, Lou van den Dries, and Angus Macintyre. Decidability and undecidability theorems for PAC-fields. Bulletin of the American Mathematical Society, n.s. vol. 4 , pp. 101–104. [REVIEW]A. Prestel - 1987 - Journal of Symbolic Logic 52 (2):568.
Gregory Cherlin and Ehud Hrushovski. Finite structures with few types. Annals of Mathematics Studies. Princeton University Press, 2003, vi + 196 pp. [REVIEW]Vera Koponen - 2008 - Bulletin of Symbolic Logic 14 (1):114-116.
Complexity of networks II: The set complexity of edge‐colored graphs.Tomasz M. Ignac, Nikita A. Sakhanenko & David J. Galas - 2012 - Complexity 17 (5):23-36.
Algebraic Logic II. Homogeneous Locally Finite Polyadic Boolean Algebras of Infinite Degree.Paul R. Halmos - 1958 - Journal of Symbolic Logic 23 (2):222-223.

Analytics

Added to PP
2009-01-28

Downloads
190 (#128,154)

6 months
5 (#1,022,671)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Finite Homogeneous 3‐Graphs.Alistair H. Lachlan & Allyson Tripp - 1995 - Mathematical Logic Quarterly 41 (3):287-306.

Add more references