Showing 2024Show all
2 papers · 1 filter
math.LO2024
The Ginsburg--Sands theorem and computability theory
Heidi Benham, Andrew De Lapo, Damir Dzhafarov +2
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 :…
math.LO2024
Computable categoricity relative to a c.e. degree
Java Darleen Villano
A computable graph is computably categorical relative to a degree if and only if for all -computable copies of , t…