Processing math: 100%
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.

A model of second-order arithmetic satisfying AC but not DC

    https://doi.org/10.1142/S0219061318500137Cited by:20 (Source: Crossref)

    We show that there is a β-model of second-order arithmetic in which the choice scheme holds, but the dependent choice scheme fails for a Π12-assertion, confirming a conjecture of Stephen Simpson. We obtain as a corollary that the Reflection Principle, stating that every formula reflects to a transitive set, can fail in models of ZFC. This work is a rediscovery by the first two authors of a result obtained by the third author in [V. G. Kanovei, On descriptive forms of the countable axiom of choice, Investigations on nonclassical logics and set theory, Work Collect., Moscow, 3-136 (1979)].