World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

HIGHER RANDOMNESS AND LIM-SUP FORCING WITHIN AND BEYOND HYPERARITHMETIC

    https://doi.org/10.1142/9789813223523_0006Cited by:1 (Source: Crossref)
    Abstract:

    We develop arboreal forcing in the context of hyperarithmetical randomness theory. In any transitive model of the Kripke-Platek set theory obtained as the companion of a Spector pointclass, we show that certain kinds of Σ1-definable lim-sup tree creature forcings have the Σ1- continuous reading of names, the Σ1-fusion property, and so on. In this way, we show that the shape of Cichoń’s diagram in hyperarithmetic theory is different from those in computability theory and set theory.