Borel combinatorics fail in HYP

Henry Towsner, Rose Weisshaar, Linda Westrick

Research output: Contribution to journalArticlepeer-review

Abstract

We characterize the completely determined Borel subsets of HYP as exactly the δ1(Lω1ck) subsets of HYP. As a result, HYP believes there is a Borel well-ordering of the reals, that the Borel Dual Ramsey Theorem fails, and that every Borel d-regular bipartite graph has a Borel perfect matching, among other examples. Therefore, the Borel Dual Ramsey Theorem and several theorems of descriptive combinatorics are not theories of hyperarithmetic analysis. In the case of the Borel Dual Ramsey Theorem, this answers a question of Astor, Dzhafarov, Montalbán, Solomon and the third author.

Original languageEnglish (US)
Article number2250023
JournalJournal of Mathematical Logic
Volume23
Issue number2
DOIs
StatePublished - Aug 1 2023

All Science Journal Classification (ASJC) codes

  • Logic

Fingerprint

Dive into the research topics of 'Borel combinatorics fail in HYP'. Together they form a unique fingerprint.

Cite this