The metamathematics of random graphs

Annals of Pure and Applied Logic 143 (1-3):20-28 (2006)
  Copy   BIBTEX

Abstract

We explain and summarize the use of logic to provide a uniform perspective for studying limit laws on finite probability spaces. This work connects developments in stability theory, finite model theory, abstract model theory, and probability. We conclude by linking this context with work on the Urysohn space

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2006.01.006

Other Versions

No versions found

Links

PhilArchive



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

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

Model theory of finite fields and pseudo-finite fields.Zoé Chatzidakis - 1997 - Annals of Pure and Applied Logic 88 (2-3):95-108.
Ramsey classes of topological and metric spaces.Jaroslav Nešetřil - 2006 - Annals of Pure and Applied Logic 143 (1-3):147-154.
An omitting types theorem for saturated structures.A. D. Greif & M. C. Laskowski - 1993 - Annals of Pure and Applied Logic 62 (2):113-118.
Super/rosy L k -theories and classes of finite structures.Cameron Donnay Hill - 2013 - Annals of Pure and Applied Logic 164 (10):907-927.
Computational model theory: an overview.M. Vardi - 1998 - Logic Journal of the IGPL 6 (4):601-624.
Finite approximation of measure and integration.Julian Webster - 2006 - Annals of Pure and Applied Logic 137 (1-3):439-449.
Logic in Finite Structures: Definability, Complexity, and Randomness.Scott Weinstein - 2002 - In Dale Jacquette (ed.), A Companion to Philosophical Logic. Malden, MA, USA: Wiley-Blackwell. pp. 332–348.
On (uniform) hierarchical decompositions of finite structures and model-theoretic geometry.Cameron Donnay Hill - 2016 - Annals of Pure and Applied Logic 167 (11):1093-1122.
Arity hierarchies.Martin Grohe - 1996 - Annals of Pure and Applied Logic 82 (2):103-163.
Characterization of NIP theories by ordered graph-indiscernibles.Lynn Scow - 2012 - Annals of Pure and Applied Logic 163 (11):1624-1641.

Analytics

Added to PP
2013-12-31

Downloads
22 (#969,010)

6 months
7 (#699,353)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Simple structures axiomatized by almost sure theories.Ove Ahlman - 2016 - Annals of Pure and Applied Logic 167 (5):435-456.

Add more citations

References found in this work

Probabilities on finite models.Ronald Fagin - 1976 - Journal of Symbolic Logic 41 (1):50-58.
Paires de structures Stables.Bruno Poizat - 1983 - Journal of Symbolic Logic 48 (2):239-249.
Ultraproducts which are not saturated.H. Jerome Keisler - 1967 - Journal of Symbolic Logic 32 (1):23-46.
On Model-Completeness.Per Lindström - 1964 - Theoria 30 (3):183-196.

View all 10 references / Add more references