Skip to main content Accessibility help
×
Home

RELATIVE PREDICATIVITY AND DEPENDENT RECURSION IN SECOND-ORDER SET THEORY AND HIGHER-ORDER THEORIES

  • SATO KENTARO (a1)

Abstract

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).

Copyright

References

Hide All
[1]Aczel, P., The strength of Martin-Löf’s type theory with one universe, Technical report, Department of Philosophy, University of Helsinki, 1977.
[2]Avigad, J., On the relationship between ATR 0and$\widehat{ID}_{ < \omega } $ , this Journal, vol. 61 (1996), no. 3, pp. 768779.
[3]Feferman, S., Predicativity, The Oxford handbook of the philosophy of mathematics and logic (Shapiro, S., editor), Oxford University Press, Oxford, 2005, pp. 590624.
[4]Flumini, D., Weak well orders, Ph.D. thesis, Universität Bern, 2013.
[5]Flumini, D. and Sato, K., From hierarchies to well foundedness, accepted for publication in Archive for Mathematical Logic, available at: www.iam.unibe.ch/ltgpub/2014/fs14.pdf 2014.
[6]Friedman, H., Higher set theory and mathematical practice. Annals of Mathematical Logic, vol. 2 (1971), no. 3, pp. 325357.
[7]Fujimoto, K., Classes and truths in set theory. Annals of Pure and Applied Logic, vol. 163 (2012), no. 11, pp. 14841523.
[8]Hinman, P., Recursion-theoretic hierarchies, Springer-Verlag, Berlin, 1970.
[9]Jäger, G. and Krähenbühl, J., ${\rm{\Sigma }}_1^1 $choice in a theory of sets and classes, Ways of proof theory (Schindler, R., editor), Ontos Verlag, Heusenstamm, 2010, pp. 283314.
[10]Krähenbühl, J., On the relationship between choice schemes and iterated class comprehension in set theory, Ph.D. thesis, Universität Bern, 2011.
[11]Kunen, K., Set theory: An introduction to consistency proofs, North Holland, Amsterdam, 1983.
[12]Sato, K., The strength of extensionality I: Weak weak set theories with infinity. Annals of Pure and Applied Logic, vol. 157 (2009), no. 2–3, pp. 234268.
[13]Sato, K., The strength of extensionality II: Weak weak set theories without infinity. Annals of Pure and Applied Logic, vol. 162 (2011), no. 8, pp. 579646.
[14]Sato, K., The strength of extensionality III: Weak weak set theories with the higher infinite, in preparation, 20∞.
[15]Simpson, S., Subsystems of second order arithmetic, Springer-Verlag, Berlin, 1999.
[16]Strahm, T., Autonomous fixed point progressions and fixed point transfinite recursion, Logic colloquium 98 (Buss, S., Hajek, P., and Pudlak, P., editors), Association of Symbolic Logic, 2000, pp. 449464.

Keywords

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed