- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
The cofinality of the saturated uncountable random graph
Archive for Mathematical Logic 43 (5):665-679 (2004)
Abstract
Assuming CH, let be the saturated random graph of cardinality ω1. In this paper we prove that it is consistent that and can be any two prescribed regular cardinals subject only to the requirementMy notes
Similar books and articles
The cofinality of the random graph.Steve Warner - 2001 - Journal of Symbolic Logic 66 (3):1439-1446.
The cofinality spectrum of the infinite symmetric group.Saharon Shelah & Simon Thomas - 1997 - Journal of Symbolic Logic 62 (3):902-916.
On chains of relatively saturated submodels of a model without the order property.Rami Grossberg - 1991 - Journal of Symbolic Logic 56 (1):124-128.
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.
Power Set Modulo Small, the Singular of Uncountable Cofinality.Saharon Shelah - 2007 - Journal of Symbolic Logic 72 (1):226 - 242.
Arithmetically Saturated Models of Arithmetic.Roman Kossak & James H. Schmerl - 1995 - Notre Dame Journal of Formal Logic 36 (4):531-546.
Reducts of the Random Bipartite Graph.Yun Lu - 2013 - Notre Dame Journal of Formal Logic 54 (1):33-46.
Wild edge colourings of graphs.Mirna Džamonja, Péter Komjáth & Charles Morgan - 2004 - Journal of Symbolic Logic 69 (1):255 - 264.
Making the hyperreal line both saturated and complete.H. Jerome Keisler & James H. Schmerl - 1991 - Journal of Symbolic Logic 56 (3):1016-1025.
Phase transitions in associative memory networks.Ben Goertzel - 1993 - Minds and Machines 3 (3):313-317.
Freely generated filters in free Boolean algebras.Joanna Grygiel - 1995 - Studia Logica 54 (2):139 - 147.
On splitting stationary subsets of large cardinals.James E. Baumgartner, Alan D. Taylor & Stanley Wagon - 1977 - Journal of Symbolic Logic 42 (2):203-214.
Infinitary logics and very sparse random graphs.James F. Lynch - 1997 - Journal of Symbolic Logic 62 (2):609-623.
Analytics
Added to PP
2013-11-23
Downloads
21 (#718,251)
6 months
2 (#1,232,442)
2013-11-23
Downloads
21 (#718,251)
6 months
2 (#1,232,442)
Historical graph of downloads
References found in this work
On the category of models of a complete theory.Daniel Lascar - 1982 - Journal of Symbolic Logic 47 (2):249-266.
Uniformization Problems and the Cofinality of the Infinite Symmetric Group.James D. Sharp & Simon Thomas - 1994 - Notre Dame Journal of Formal Logic 35 (3):328-345.
Unbounded families and the cofinality of the infinite symmetric group.James D. Sharp & Simon Thomas - 1995 - Archive for Mathematical Logic 34 (1):33-45.
Changing cardinal characteristics without changing ω-sequences or cofinalities.Heike Mildenberger & Saharon Shelah - 2000 - Annals of Pure and Applied Logic 106 (1-3):207-261.
The cofinality of the random graph.Steve Warner - 2001 - Journal of Symbolic Logic 66 (3):1439-1446.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-5tf24 uwo