A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
DOP and FCP in generic structures

1998
*
Journal of Symbolic Logic (JSL)
*

We work throughout in a finite relational language L. This paper is built on [2] and [3]. We repeat some of the basic notions and results from these papers for the convenience of the reader but familiarity with the setup in the first few sections of [3] is needed to read this paper. Spencer and Shelah [6] constructed for each irrational α between 0 and 1 the theory T α as the almost sure theory of random graphs with edge probability n −α. In [2] we proved that this was the same theory as the

doi:10.2307/2586841
fatcat:6rahqu2uijfsrj6z4v4mgwt4uq