Saturating the Random Graph with an Independent Family of Small Range [Book Review]

&
In Åsa Hirvonen, Juha Kontinen, Roman Kossak & Andrés Villaveces (eds.), Logic Without Borders: Essays on Set Theory, Model Theory, Philosophical Logic and Philosophy of Mathematics. Boston: De Gruyter. pp. 319-338 (2015)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1515/9781614516873.319

Links

PhilArchive



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

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

Saturating ultrafilters on N.D. H. Fremlin & P. J. Nyikos - 1989 - Journal of Symbolic Logic 54 (3):708-718.
The conjugacy problem for the automorphism group of the random graph.Samuel Coskey, Paul Ellis & Scott Schneider - 2011 - Archive for Mathematical Logic 50 (1-2):215-221.
The cofinality of the random graph.Steve Warner - 2001 - Journal of Symbolic Logic 66 (3):1439-1446.
The cofinality of the saturated uncountable random graph.Steve Warner - 2004 - Archive for Mathematical Logic 43 (5):665-679.
A comparison inequality for sums of independent random variables.Stephen J. Montgomery-Smith & Alexander R. Pruss - unknown
Reducts of the Random Bipartite Graph.Yun Lu - 2013 - Notre Dame Journal of Formal Logic 54 (1):33-46.
In the random graph G(n, p), p = n−a: If ψ has probability O(n−ε) for every ε > 0 then it has probability O(e−nε) for some ε > 0.Saharon Shelah - 1996 - Annals of Pure and Applied Logic 82 (1):97-102.
In the random graph< i> G(< i> n_,< i> p_),< i> p_=< i> n_< sup>− a: If ψ has probability< i> O_(< i> n_< sup>− ε) for every< i> ε_> 0 then it has probability< i> O_(< i> e_< sup>− nε) for some< i> ε> 0. [REVIEW]Saharon Shelah - 1996 - Annals of Pure and Applied Logic 82 (1):97-102.
Weak Borel chromatic numbers.Stefan Geschke - 2011 - Mathematical Logic Quarterly 57 (1):5-13.
Phase transitions in associative memory networks.Ben Goertzel - 1993 - Minds and Machines 3 (3):313-317.
Infinitary logics and very sparse random graphs.James F. Lynch - 1997 - Journal of Symbolic Logic 62 (2):609-623.
What is a Random String?Cristian Calude - 1995 - Vienna Circle Institute Yearbook 3:101-113.
Adding one random real.Tomek Bartoszyński, Andrzej Rosłanowski & Saharon Shelah - 1996 - Journal of Symbolic Logic 61 (1):80-90.
Regularization, Adaptation, and Non-Independent Features Improve Hidden Conditional Random Fields for Phone Classification.Christopher Manning - unknown
Randomness and Halting Probabilities.VeróNica Becher, Santiago Figueira, Serge Grigorieff & Joseph S. Miller - 2006 - Journal of Symbolic Logic 71 (4):1411 - 1430.

Analytics

Added to PP
2015-03-31

Downloads
9 (#1,228,347)

6 months
2 (#1,240,909)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references