Abstract
AbstractFor a class of operators , let denote the closure ordinal of ‐inductive definitions. We give upper bounds on the values of and under the assumption that all projective sets of reals are determined, significantly improving the known results. In particular, the bounds show that and hold for under the assumption of projective determinacy. Some of these inequalities were obtained by Aanderaa in the 70s via recursion‐theoretic methods but never appeared in print. Our proofs are model‐theoretic.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
