Levels of discontinuity, limit-computability, and jump operators

zbMath1344.03037arXiv1312.0697MaRDI QIDQ4982344

Matthew De Brecht

Publication date: 9 April 2015

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

zbMATH Keywords

category theorydescriptive set theorycomputable analysisBorel complexity

Mathematics Subject Classification ID

Descriptive set theory (03E15) Constructive and recursive analysis (03F60) Categorical logic, topoi (03G30) Descriptive set theory (topological aspects of Borel, analytic, projective, etc. sets) (54H05) Classification of real functions; Baire classification of sets and functions (26A21) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (14)

Effective aspects of Hausdorff and Fourier dimension ⋮ Unnamed Item ⋮ A topological view on algebraic computation models ⋮ Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract) ⋮ A comparison of concepts from computable analysis and effective descriptive set theory ⋮ Notes on overt choice ⋮ Borel-Piecewise Continuous Reducibility for Uniformization Problems ⋮ Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions ⋮ Game characterizations and lower cones in the Weihrauch degrees ⋮ Game characterizations and lower cones in the Weihrauch degrees ⋮ Unnamed Item ⋮ Decomposing Borel functions using the Shore–Slaman join theorem ⋮ Computability of Subsets of Metric Spaces ⋮ Weihrauch Complexity in Computable Analysis

This page was built for publication: Levels of discontinuity, limit-computability, and jump operators