Deciding the chromatic numbers of algebraic hypergraphs

Journal of Symbolic Logic 83 (1):128-145 (2018)
  Copy   BIBTEX

Abstract

For each infinite cardinalκ, the set of algebraic hypergraphs having chromatic number no larger thanκis decidable.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,203

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Weak Borel chromatic numbers.Stefan Geschke - 2011 - Mathematical Logic Quarterly 57 (1):5-13.
Decidable regularly closed fields of algebraic numbers.Louden Dries & Rick L. Smith - 1985 - Journal of Symbolic Logic 50 (2):468 - 475.
Measurable chromatic numbers.Benjamin D. Miller - 2008 - Journal of Symbolic Logic 73 (4):1139-1157.
The graph-theoretic approach to descriptive set theory.Benjamin D. Miller - 2012 - Bulletin of Symbolic Logic 18 (4):554-575.
The monadic second-order logic of graphs VIII: Orientations.Bruno Courcelle - 1995 - Annals of Pure and Applied Logic 72 (2):103-143.

Analytics

Added to PP
2018-05-03

Downloads
17 (#1,196,561)

6 months
5 (#702,808)

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