Coloring Isosceles Triangles in Choiceless Set Theory

Journal of Symbolic Logic:1-30 (forthcoming)
  Copy   BIBTEX

Abstract

It is consistent relative to an inaccessible cardinal that ZF+DC holds, and the hypergraph of isosceles triangles on $\mathbb {R}^2$ has countable chromatic number while the hypergraph of isosceles triangles on $\mathbb {R}^3$ has uncountable chromatic number.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,127

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

Potential continuity of colorings.Stefan Geschke - 2008 - Archive for Mathematical Logic 47 (6):567-578.
Weak Borel chromatic numbers.Stefan Geschke - 2011 - Mathematical Logic Quarterly 57 (1):5-13.
The Largest Countable Inductive Set is a Mouse Set.Mitch Rudominer - 1999 - Journal of Symbolic Logic 64 (2):443-459.
Successors of Singular Cardinals and Coloring Theorems II.Todd Eisworth & Saharon Shelah - 2009 - Journal of Symbolic Logic 74 (4):1287 - 1309.
Generic graph construction.James E. Baumgartner - 1984 - Journal of Symbolic Logic 49 (1):234-240.
Infinite combinatorics plain and simple.Dániel T. Soukup & Lajos Soukup - 2018 - Journal of Symbolic Logic 83 (3):1247-1281.
Measurable chromatic numbers.Benjamin D. Miller - 2008 - Journal of Symbolic Logic 73 (4):1139-1157.
Models of set theory with definable ordinals.Ali Enayat - 2005 - Archive for Mathematical Logic 44 (3):363-385.

Analytics

Added to PP
2023-09-12

Downloads
11 (#1,167,245)

6 months
7 (#491,177)

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

Krull dimension in set theory.Jindřich Zapletal - 2023 - Annals of Pure and Applied Logic 174 (9):103299.

Add more references