Abstract.
If and the function is partial recursive, it is easily seen that A is recursive. In this paper, we weaken this hypothesis in various ways (and similarly for ``min'' in place of ``max'') and investigate what effect this has on the complexity of A. We discover a sharp contrast between retraceable and co-retraceable sets, and we characterize sets which are the union of a recursive set and a co-r.e., retraceable set. Most of our proofs are noneffective. Several open questions are raised.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 28 November 1999 / Published online: 31 May 2002
Rights and permissions
About this article
Cite this article
Owings, J., Gasarch, W. & Martin, G. Max and min limiters. Arch. Math. Logic 41, 483–495 (2002). https://doi.org/10.1007/s001530100121
Issue Date:
DOI: https://doi.org/10.1007/s001530100121