A proof of Lusin's Theorem through near-uniformity of the iterated Turing jump, giving uniform effective versions and a lowness-based account of where discontinuities must occur.
Weihrauch; Computable Analysis: An Introduction (Berlin: Springer, 2000)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.LO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Effectivizing Lusin's Theorem
A proof of Lusin's Theorem through near-uniformity of the iterated Turing jump, giving uniform effective versions and a lowness-based account of where discontinuities must occur.