Annals of Pure and Applied Logic 143 (1-3):20-28 (2006)
| Authors | |
| 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
|
| Keywords | No keywords specified (fix it) |
| Categories | (categorize this paper) |
| DOI | 10.1016/j.apal.2006.01.006 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
References found in this work BETA
Ultraproducts Which Are Not Saturated.H. Jerome Keisler - 1967 - Journal of Symbolic Logic 32 (1):23-46.
Almost Everywhere Equivalence of Logics in Finite Model Theory.Lauri Hella, Phokion G. Kolaitis & Kerkko Luosto - 1996 - Bulletin of Symbolic Logic 2 (4):422-443.
View all 11 references / Add more references
Citations of this work BETA
Simple Structures Axiomatized by Almost Sure Theories.Ove Ahlman - 2016 - Annals of Pure and Applied Logic 167 (5):435-456.
Similar books and articles
Random Graphs in the Monadic Theory of Order.Shmuel Lifsches & Saharon Shelah - 1999 - Archive for Mathematical Logic 38 (4-5):273-312.
Spatial Embedding and the Structure of Complex Networks.S. Bullock, L. Barnett & E. A. Di Paolo - 2010 - Complexity 16 (2):20-28.
Infinitary Logics and Very Sparse Random Graphs.James F. Lynch - 1997 - Journal of Symbolic Logic 62 (2):609-623.
Adding One Random Real.Tomek Bartoszyński, Andrzej Rosłanowski & Saharon Shelah - 1996 - Journal of Symbolic Logic 61 (1):80-90.
The Metamathematics of Algebraic Systems, Collected Papers: 1936-1967.A. I. Malʹt͡sev - 1971 - Amsterdam: North-Holland Pub. Co..
Expansions of Ultrahomogeneous Graphs.J. E. Helmreich - 1995 - Notre Dame Journal of Formal Logic 36 (3):414-424.
Small Universal Families for Graphs Omitting Cliques Without GCH.Katherine Thompson - 2010 - Archive for Mathematical Logic 49 (7-8):799-811.
“Clarifying the Nature of the Infinite”: The Development of Metamathematics and Proof Theory.Jeremy Avigad - manuscript
Random Closed Sets Viewed as Random Recursions.R. Daniel Mauldin & Alexander P. McLinden - 2009 - Archive for Mathematical Logic 48 (3-4):257-263.
Erdős Graphs Resolve Fine's Canonicity Problem.Robert Goldblatt, Ian Hodkinson & Yde Venema - 2004 - Bulletin of Symbolic Logic 10 (2):186-208.
‘Metamathematics’ in Transition.Matthias Wille - 2011 - History and Philosophy of Logic 32 (4):333 - 358.
On the Construction of Effectively Random Sets.Wolfgang Merkle & Nenad Mihailović - 2004 - Journal of Symbolic Logic 69 (3):862-878.
Analytics
Added to PP index
2013-12-31
Total views
13 ( #768,750 of 2,505,148 )
Recent downloads (6 months)
1 ( #416,587 of 2,505,148 )
2013-12-31
Total views
13 ( #768,750 of 2,505,148 )
Recent downloads (6 months)
1 ( #416,587 of 2,505,148 )
How can I increase my downloads?
Downloads
