Archive for Mathematical Logic 56 (7-8):783-796 (2017)

Abstract
May the same graph admit two different chromatic numbers in two different universes? How about infinitely many different values? and can this be achieved without changing the cardinals structure? In this paper, it is proved that in Gödel’s constructible universe, for every uncountable cardinal \ below the first fixed-point of the \-function, there exists a graph \ satisfying the following:\ has size and chromatic number \;for every infinite cardinal \, there exists a cofinality-preserving \-preserving forcing extension in which \=\kappa \).
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
DOI 10.1007/s00153-017-0551-x
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 71,172
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No Bound for the First Fixed Point.Moti Gitik - 2005 - Journal of Mathematical Logic 5 (02):193-246.
Some Results on Higher Suslin Trees.R. David - 1990 - Journal of Symbolic Logic 55 (2):526-536.

Add more references

Citations of this work BETA

A Microscopic Approach to Souslin-Tree Constructions, Part I.Ari Meir Brodsky & Assaf Rinot - 2017 - Annals of Pure and Applied Logic 168 (11):1949-2007.

Add more citations

Similar books and articles

Feasible Graphs with Standard Universe.Douglas Cenzer & Jeffrey B. Remmel - 1998 - Annals of Pure and Applied Logic 94 (1-3):21-35.
Random Generations of the Countable Random Graph.Su Gao & A. Vershik - 2006 - Annals of Pure and Applied Logic 143 (1-3):79-86.
Effective Coloration.Dwight R. Bean - 1976 - Journal of Symbolic Logic 41 (2):469-480.
Isomorphisms and Nonisomorphisms of Graph Models.Harold Schellinx - 1991 - Journal of Symbolic Logic 56 (1):227-249.
Graph Spectra for Communications in Biological and Carbon Nanotube Networks.Stephen F. Bush & Sanjay Goel - forthcoming - Ieee Journal on Selected Areas in Communications:1--10.
On the Finiteness of the Recursive Chromatic Number.William I. Gasarch & Andrew C. Y. Lee - 1998 - Annals of Pure and Applied Logic 93 (1-3):73-81.
Twilight Graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.
Feasible Graphs and Colorings.Douglas Cenzer & Jeffrey Remmel - 1995 - Mathematical Logic Quarterly 41 (3):327-352.
Graph Coloring and Reverse Mathematics.James H. Schmerl - 2000 - Mathematical Logic Quarterly 46 (4):543-548.
Emergence of Geometry in a Combinatorial Universe.Paul Baird - 2013 - Journal of Geometry and Physics 74:185-195.
Reverse Mathematics and the Coloring Number of Graphs.Matthew Jura - 2016 - Notre Dame Journal of Formal Logic 57 (1):27-44.

Analytics

Added to PP index
2017-05-09

Total views
4 ( #1,282,272 of 2,517,823 )

Recent downloads (6 months)
2 ( #272,606 of 2,517,823 )

How can I increase my downloads?

Downloads

My notes