Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-18T01:56:49.819Z Has data issue: false hasContentIssue false

Induction and inductive definitions in fragments of second order arithmetic

Published online by Cambridge University Press:  12 March 2014

Klaus Aehlig*
Affiliation:
Mathematisches Institut, Universität München, Theresienstr. 39, 80333 München, Germany,, E-mail: aehlig@mathematik.uni-muenchen.de

Abstract

A fragment with the same provably recursive functions as n iterated inductive definitions is obtained by restricting second order arithmetic in the following way. The underlying language allows only up to n + 1 nested second order quantifications and those are in such a way. that no second order variable occurs free in the scope of another second order quantifier. The amount of induction on arithmetical formulae only affects the arithmetical consequences of these theories, whereas adding induction for arbitrary formulae increases the strength by one inductive definition.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2005

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable