Searching problems above arithmetical transfinite recursion
arXiv:2305.07321
Abstract
We investigate some Weihrauch problems between and . We show that the fixed point theorem for monotone operators on the Cantor space (a weaker version of the Knaster-Tarski theorem) is not Weihrauch reducible to . Furthermore, we introduce the -model reflection of and show that it is an upper bound for problems provable from the axiomatic system which are of the form with arithmetical formulas . We also show that Weihrauch degrees of relativized least fixed point theorem for monotone operators on the Cantor space forms a linear hierarchy between and .