The cofinality of the random graph
Journal of Symbolic Logic 66 (3):1439-1446 (2001)
| Abstract | We show that under Martin's Axiom, the cofinality cf(Aut(Γ)) of the automorphism group of the random graph Γ is 2 ω | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,709 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesJörg Brendle & Maria Losada (2003). The Cofinality of the Infinite Symmetric Group and Groupwise Density. Journal of Symbolic Logic 68 (4):1354-1361.
Saharon Shelah & Simon Thomas (1997). The Cofinality Spectrum of the Infinite Symmetric Group. Journal of Symbolic Logic 62 (3):902-916.
Harold Schellinx (1991). Isomorphisms and Nonisomorphisms of Graph Models. Journal of Symbolic Logic 56 (1):227-249.
Dwight R. Bean (1976). Effective Coloration. Journal of Symbolic Logic 41 (2):469-480.
Heike Mildenberger & Saharon Shelah (2011). The Minimal Cofinality of an Ultrapower of Ω and the Cofinality of the Symmetric Groupcan Be Larger Than. Journal of Symbolic Logic 76 (4):1322-1340.
Peter Spirtes (2005). Graphical Models, Causal Inference, and Econometric Models. Journal of Economic Methodology 12 (1):3-34.
Simon Thomas (1991). Reducts of the Random Graph. Journal of Symbolic Logic 56 (1):176-181.
James F. Lynch (1997). Infinitary Logics and Very Sparse Random Graphs. Journal of Symbolic Logic 62 (2):609-623.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #275,053 of 549,694 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
