
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.
Inductive definability, Inner models, including constructibility, ordinal definability, and core models, /dk/atira/pure/core/keywords/school_of_mathematics/pure_mathematics, Set Theory, name=Pure Mathematics, Computability and recursion theory on ordinals, admissible sets, etc., 510, 543
Inductive definability, Inner models, including constructibility, ordinal definability, and core models, /dk/atira/pure/core/keywords/school_of_mathematics/pure_mathematics, Set Theory, name=Pure Mathematics, Computability and recursion theory on ordinals, admissible sets, etc., 510, 543
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
