Successor levels of the Jensen hierarchy
β Scribed by Gunter Fuchs
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 216 KB
- Volume
- 55
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
I prove that there is a recursive function T that does the following: Let X be transitive and rudimentarily closed, and let X β² be the closure of X βͺ {X } under rudimentary functions. Given a Ξ£~0~βformula Ο (x) and a code c for a rudimentary function f, T (Ο, c, $ \vec x $) is a Ξ£~Ο~ βformula such that for any $ \vec a $ β X, X β² β§ Ο [f ($ \vec a $)] iff X β§ T (Ο, c, $ \vec x $)[$ \vec a $]. I make this precise and show relativized versions of this. As an application, I prove that under certain conditions, if Y is the Ξ£~Ο~ extender ultrapower of X with respect to some extender F that also is an extender on X β², then the closure of Y βͺ {Y } under rudimentary functions is the Ξ£~0~ extender ultrapower of Xβ² with respect to F, and the ultrapower embeddings agree on X. (Β© 2009 WILEYβVCH Verlag GmbH & Co. KGaA, Weinheim)
π SIMILAR VOLUMES
Molecular data are widely used to reconstruct phylogenetic relationships among species, and these phylogenies are often used as the basis for inferences about the history of evolutionary change in other nonmolecular characters. This approach is an appropriate and powerful one in many circumstances.
Task hierarchies can be used to decompose an intractable problem into smaller more manageable tasks. This paper examines an existing algorithm (HEXQ) that automatically discovers a task hierarchy through interaction with the environment. The initial performance of the algorithm can be limited becaus
On page 230, 11 th line from the bottom, reference is made to "Soare", This should be changed to "Richard Shore of M.I.f.".