Hostname: page-component-7b7567c8c-48dgx Total loading time: 0 Render date: 2026-11-18T08:30:49.070Z Has data issue: false hasContentIssue false

RELATIVE PREDICATIVITY AND DEPENDENT RECURSION IN SECOND-ORDER SETTHEORY AND HIGHER-ORDER THEORIES

Published online by Cambridge University Press:  18 August 2014

SATO KENTARO*
Affiliation:
INSTITUT FÜR INFORMATIK UND ANGEWANDTE MATHEMATIK, UNIVERSITÄT BERN, CH3012 BERN, SWITZERLAND, E-mail: sato@iam.unibe.ch
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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

Information

Type
Articles
Copyright
Copyright © The Association for Symbolic Logic 2014