Reducts of the random graph

Journal of Symbolic Logic 56 (1):176-181 (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Reducts of (c, +, ⋅) which contain +.D. Marker & A. Pillay - 1990 - Journal of Symbolic Logic 55 (3):1243-1251.
The cofinality of the random graph.Steve Warner - 2001 - Journal of Symbolic Logic 66 (3):1439-1446.
Saturated models of peano arithmetic.J. F. Pabion - 1982 - Journal of Symbolic Logic 47 (3):625-637.
Infinitary logics and very sparse random graphs.James F. Lynch - 1997 - Journal of Symbolic Logic 62 (2):609-623.
Graphical models, causal inference, and econometric models.Peter Spirtes - 2005 - Journal of Economic Methodology 12 (1):3-34.
Effective coloration.Dwight R. Bean - 1976 - Journal of Symbolic Logic 41 (2):469-480.
Isomorphisms and nonisomorphisms of graph models.Harold Schellinx - 1991 - Journal of Symbolic Logic 56 (1):227-249.
Reducts of some structures over the reals.Ya′Acov Peterzil - 1993 - Journal of Symbolic Logic 58 (3):955-966.
Twilight graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.

Analytics

Added to PP
2009-01-28

Downloads
55 (#284,906)

6 months
26 (#109,749)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

First-order logical duality.Steve Awodey - 2013 - Annals of Pure and Applied Logic 164 (3):319-348.
Reducts of random hypergraphs.Simon Thomas - 1996 - Annals of Pure and Applied Logic 80 (2):165-193.
Reducts of the generic digraph.Lovkush Agarwal - 2016 - Annals of Pure and Applied Logic 167 (3):370-391.
Strongly determined types.Alexandre A. Ivanov & Dugald Macpherson - 1999 - Annals of Pure and Applied Logic 99 (1-3):197-230.

View all 11 citations / Add more citations

References found in this work

No references found.

Add more references