Computability of Separation Axioms in Countable Second Countable Spaces

TL;DR

This paper investigates the computational complexity of separation axioms and other topological properties in countable, second countable spaces, providing precise arithmetic completeness results that improve upon previous reverse mathematics analyses.

Contribution

It introduces a detailed computability analysis of separation axioms and topological properties, establishing arithmetic completeness results for these properties.

Findings

Arithmetic completeness results for Tychonoff separation axioms

Computability classifications for Polish spaces and Cantor-Bendixson rank

Contrast with reverse mathematics frameworks

Abstract

We analyze the effective content of countable, second countable topological spaces by directly calculating the complexity of several topologically defined index sets. We focus on the separation principles, calibrating an arithmetic completeness result for each of the Tychonoff separation axioms. Beyond this, we prove completeness results for various other topological properties, such as being Polish and having a particular Cantor-Bendixson rank, using tools from computable structure theory. This work contrasts with previous work analyzing countable, second countable spaces which used the framework of reverse mathematics, as reverse mathematics generally lacks the precision to pin down exact arithmetic complexity levels for properties of interest.