Computability of Separation Axioms in Countable Second Countable Spaces

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: DeLapo, Andrew, Gonzalez, David
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909703875854336
author DeLapo, Andrew
Gonzalez, David
author_facet DeLapo, Andrew
Gonzalez, David
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2507_18564
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Computability of Separation Axioms in Countable Second Countable Spaces
DeLapo, Andrew
Gonzalez, David
Logic
General Topology
03D55, 54D10 (Primary) 03D45, 06A05, 54G20 (Secondary)
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.
title Computability of Separation Axioms in Countable Second Countable Spaces
topic Logic
General Topology
03D55, 54D10 (Primary) 03D45, 06A05, 54G20 (Secondary)
url https://arxiv.org/abs/2507.18564