The Determined Property of Baire in Reverse Math

${\mathsf {CAC\ for\ trees}}$ is the statement asserting that any infinite subtree of $\mathbb {N}^{<\mathbb {N}}$ has an infinite path or an infinite antichain. In this paper, we study the computational strength of this theorem from a reverse mathematical viewpoint. We prove that ${\mathsf {CAC\ for\ trees}}$ is robust, that is, there exist several characterizations, some of which already appear in the literature, namely, the statement $\mathsf {SHER}$ introduced by Dorais et al. [8], and the statement $\mathsf {TAC}+\mathsf {B}\Sigma ^0_2$ where $\mathsf {TAC}$ is the tree antichain theorem introduced by Conidis [6]. We show that ${\mathsf {CAC\ for\ trees}}$ is computationally very weak, in that it admits probabilistic solutions.

show abstract

“…Proof. These three statements have a computable instance such that the measure of the oracles computing a solution is 0, see Astor et al [1]. ⊣…”

Section: Definition 23 (Completely Branching Tree)mentioning

confidence: 99%

The Reverse Mathematics of Cac for Trees

CERVELLE¹,

GAUDELIER²,

Patey

2023

J. symb. log.

View full text Add to dashboard Cite

show abstract

Borel combinatorics fail in HYP

2022

View full text Add to dashboard Cite

We characterize the completely determined Borel subsets of HYP as exactly the [Formula: see text] 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 [Formula: see text]-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.

show abstract