Open sets in computability theory and reverse mathematics

DOI10.1093/logcom/exaa049zbMath1472.03012arXiv1910.02489OpenAlexW3090093830MaRDI QIDQ5140330

Sam Sanders, Dag Normann

Publication date: 15 December 2020

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.02489

zbMATH Keywords

typereverse mathematicscomputabilityCantorBaireUrysohnhyperarithmeticBorelhigher-order arithmetichigher-order computabilityHeineTietzeBendixsonDelta functional

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Foundations of classical theories (including reverse mathematics) (03B30) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35) Higher-type and set recursion theory (03D65)

Related Items (max. 100)

Countable sets versus sets that are countable in reverse mathematics ⋮ Representations and the foundations of mathematics ⋮ ON THE UNCOUNTABILITY OF ⋮ Betwixt Turing and Kleene ⋮ Between Turing and Kleene ⋮ Cousin’s lemma in second-order arithmetic ⋮ Lifting proofs from countable to uncountable mathematics ⋮ The non-normal abyss in Kleene's computability theory ⋮ On the computational properties of the uncountability of the real numbers ⋮ Reverse mathematics of topology: dimension, paracompactness, and splittings ⋮ Reverse mathematics of the uncountability of \(\mathbb{R}\) ⋮ On false Heine/Borel compactness principles in proof mining ⋮ Splittings and robustness for the Heine-Borel theorem

This page was built for publication: Open sets in computability theory and reverse mathematics