SearcharxivSearch

arXiv subjects

Java Darleen Villano

Publications and source records attributed to Java Darleen Villano.

4 recordsLinked to original sources

Extensions of categoricity relative to a degree

In this paper, we apply the machinery developed in arXiv:2401.06641(2) to study the behavior of computable categoricity relativized to non-c.e. degrees. In particular, we show that we can build a computable structure which is not computably categorical but is computably categorical relative to a $1$-generic degree. Additionally, we show that other classes of structures besides directed graphs admit a computable example which can change its computable categorical behavior relative to different degrees.

math.LO

The Ginsburg--Sands theorem and computability theory

The Ginsburg--Sands theorem from topology states that every infinite topological space has an infinite subspace homeomorphic to exactly one of the following five topologies on $\omega$: indiscrete, discrete, initial segment, final segment, and cofinite. The original proof is nonconstructive, and features an interesting application of Ramsey's theorem for pairs ($\mathsf{RT}^2_2$). We analyze this principle in computability theory and reverse mathematics, using Dorais's formalization of CSC spaces. Among our results are that the Ginsburg-Sands theorem for CSC spaces is equivalent to $\mathsf{ACA}_0$, while for Hausdorff spaces it is provable in $\mathsf{RCA}_0$. Furthermore, if we enrich a CSC space by adding the closure operator on points, then the Ginsburg-Sands theorem turns out to be equivalent to the chain/antichain principle ($\mathsf{CAC}$). The most surprising case is that of the Ginsburg-Sands theorem restricted to $T_1$ spaces. Here, we show that the principle lies strictly between $\mathsf{ACA}_0$ and $\mathsf{RT}^2_2$, yielding arguably the first natural theorem from outside logic to occupy this interval. As part of our analysis of the $T_1$ case we introduce a new class of purely combinatorial principles below $\mathsf{ACA}_0$ and not implied by $\mathsf{RT}^2_2$ which form a strict hierarchy generalizing the stable Ramsey's theorem for pairs ($\mathsf{SRT}^2_2$). We show that one of these, the $\Sigma^0_2$ subset principle ($\Sigma^0_2$-$\mathsf{Subset}$), has the property that it, together with the cohesive principle ($\mathsf{COH}$), is equivalent over $\mathsf{RCA}_0$ to the Ginsburg--Sands theorem for $T_1$ CSC spaces.

math.LO

Computable categoricity relative to a c.e. degree

A computable graph $\mathcal{G}$ is computably categorical relative to a degree $\mathbf{d}$ if and only if for all $\mathbf{d}$-computable copies $\mathcal{B}$ of $\mathcal{G}$, there is a $\mathbf{d}$-computable isomorphism $f:\mathcal{G}\to\mathcal{B}$. In this paper, we prove that for every computable partially ordered set $P$ and computable partition $P=P_0\sqcup P_1$, there exists a computable computably categorical graph $\mathcal{G}$ and an embedding $h$ of $P$ into the c.e. degrees where $\mathcal{G}$ is computably categorical relative to all degrees in $h(P_0)$ and not computably categorical relative to any degree in $h(P_1)$. This is a generalization of a 2021 result by Downey, Harrison-Trainor, and Melnikov.

math.LO

Normality, Relativization, and Randomness

Normal numbers were introduced by Borel and later proven to be a weak notion of algorithmic randomness. We introduce here a natural relativization of normality based on generalized number representation systems. We explore the concepts of supernormal numbers that correspond to semicomputable relativizations, and that of highly normal numbers in terms of computable ones. We prove several properties of these new randomness concepts. Both supernormality and high normality generalize Borel absolute normality. Supernormality is strictly between 2-randomness and effective dimension 1, while high normality corresponds exactly to sequences of computable dimension 1 providing a more natural characterization of this class.

math.LO