Relative Predicativity and dependent recursion in second-order set theory and higher-orders theories

Sato, Kentaro (2014). Relative Predicativity and dependent recursion in second-order set theory and higher-orders theories. The journal of symbolic logic, 79(03), pp. 712-732. Cambridge University Press 10.1017/jsl.2014.28

Preview	Text sat12.pdf - Submitted Version Available under License Publisher holds Copyright. Download (296kB) | Preview
Preview	Text S0022481214000280.pdf - Published Version Available under License Publisher holds Copyright. Download (289kB) | Preview

This article reports that some robustness of the notions of predicativity and of autonomous progression is broken down if as the given infinite total entity we choose some mathematical entities other than the traditional ω. Namely, the equivalence between normal transfinite recursion scheme and new dependent transfinite recursion scheme, which does hold in the context of subsystems of second order number theory, does not hold in the context of subsystems of second order set theory where the universe V of sets is treated as the given totality (nor in the contexts of those of n+3-th order number or set theories, where the class of all n+2-th order objects is treated as the given totality).

Interest & Impact

Downloads

357 since deposited on 23 Jan 2015
44 in the past 12 months

Citations

5 Citations in Web of Science ®
6 Citations in Scopus

Search

in Google Scholar™

Services

Actions (login required)

Edit item

Actions (login required)

Edit item