Computability on the countable ordinals and the Hausdorff-Kuratowski theorem.
Arno Pauly · arXiv (Cornell University) · 2015
In this note, we explore various potential representations of the set of countable ordinals. An equivalence class of representations is then suggested as a standard, as it offers the desired closure properties. With a decent notion of computability on the space of countable ordinals in place, we can then state and prove a computable uniform version of the Hausdorff-Kuratowski theorem.