Effectivizing Lusin’s Theorem

DOI10.4115/jla.2022.14.3OpenAlexW2968573075MaRDI QIDQ5870345

Russell G. Miller

Publication date: 9 January 2023

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

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

zbMATH Keywords

computabilitycomputable analysisLusin's Theorem

Mathematics Subject Classification ID

Descriptive set theory (03E15) Constructive and recursive analysis (03F60) Continuity and related questions (modulus of continuity, semicontinuity, discontinuities, etc.) for real functions in one variable (26A15) Applications of computability and recursion theory (03D80) Classification of real functions; Baire classification of sets and functions (26A21) Computation over the reals, computable analysis (03D78)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computable structures and the hyperarithmetical hierarchy
• Generic computability, Turing degrees, and asymptotic density
• Decidability of the “almost all” theory of degrees

This page was built for publication: Effectivizing Lusin’s Theorem