Abstract
We give an explicit AE-axiomatization of the almost sure theories of sparse random graphs G(n, n −α) of Shelah-Spencer. In the process we give a method of constructing extensions of graphs whose ‘relative dimension’ is negative, but arbitrarily small. We describe the existentially closed and locally finite models of the theory and produce types of dimension zero. We offer a useful characterization of forking and generalize results about stability and the Dimensional Order Property (DOP) that were known for graphs to arbitrary relational languages.
Similar content being viewed by others
References
J. T. Baldwin and S. Shelah, Randomness and semigenericity, Transactions of the American Mathematical Society 349 (1997), 1359–1376.
J. T. Baldwin and S. Shelah, DOP and FCP in generic structures, Journal of Symbolic Logic 63 (1998), 427–438.
J. T. Baldwin and N. Shi, Stable generic structures, Annals of Pure and Applied Logic 79 (1996), 1–35.
K. Ikeda, A remark on the stability of saturated generic graphs, preprint.
I. Niven and H. Zuckerman, An introduction to the theory of numbers, 3rd edition, Wiley, New York, 1972.
S. Shelah and J. Spencer, Zero-one laws for sparse random graphs, Journal of the American Mathematical Society 1 (1988), 97–115.
J. Spencer, The strange logic of random graphs, Springer-Verlag, Berlin, 2001.
F. O. Wagner, Relational structures and dimensions, in Automorphisms of first-order structures, Oxford Sci. Publ., Oxford University Press, New York, 1994, pp. 153–180.
Author information
Authors and Affiliations
Corresponding author
Additional information
Partially supported by NSF grant DMS-0300080. The author thanks John Baldwin for several useful conversations.
Rights and permissions
About this article
Cite this article
Laskowski, M.C. A simpler axiomatization of the Shelah-Spencer almost sure theories. Isr. J. Math. 161, 157–186 (2007). https://doi.org/10.1007/s11856-007-0077-8
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s11856-007-0077-8