An effective analysis of the Denjoy rank

Abstract: We analyze the descriptive complexity of several

P i_{1}^{1}

ranks from classical analysis which are associated to Denjoy integration. We show that

V B G, V B G_{a} s t, A C G

and

A C G_{a} s t

are

P i_{1}^{1}

-complete, answering a question of Walsh in case of

A C G_{a} s t

. Furthermore, we identify the precise descriptive complexity of the set of functions obtainable with at most

a l p h a

steps of the transfinite process of Denjoy totalization: if

| c d o t |

is the

P i_{1}^{1}

-rank naturally associated to

V B G, V B G_{a} s t

or

A C G_{a} s t

, and if

a l p h a < o m e g a_{1}^{c k}

, then

F i n C (I) : | F | l e q a l p h a

is

S i g m a_{2 a l p h a}^{0}

-complete. These finer results are an application of the author's previous work on the limsup rank on well-founded trees. Finally,

(f, F) i n M (I) i m e s C (I) : F i n A C G_{a} s t e x t a n d F^{'} = f e x t a . e .

and

f i n M (I) : f e x t i s D e n j o y i n t e g r a b l e

are

P i_{1}^{1}

-complete, answering more questions of Walsh.

Recommendations

Cites Work

Cited In (2)

This page was built for publication: An effective analysis of the Denjoy rank