Some theories with positive induction of ordinal strength ϕω

Journal of Symbolic Logic 61 (3):818-842 (1996)
  Copy   BIBTEX

Abstract

This paper deals with: (i) the theory ID # 1 which results from $\widehat{\mathrm{ID}}_1$ by restricting induction on the natural numbers to formulas which are positive in the fixed point constants, (ii) the theory BON(μ) plus various forms of positive induction, and (iii) a subtheory of Peano arithmetic with ordinals in which induction on the natural numbers is restricted to formulas which are Σ in the ordinals. We show that these systems have proof-theoretic strength φω 0

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,227

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
42 (#380,966)

6 months
15 (#171,570)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Proof Theory.Gaisi Takeuti - 1990 - Studia Logica 49 (1):160-161.
Notes on Formal Theories of Truth.Andrea Cantini - 1989 - Mathematical Logic Quarterly 35 (2):97-130.
Fragments of arithmetic.Wilfried Sieg - 1985 - Annals of Pure and Applied Logic 28 (1):33-71.
Notes on Formal Theories of Truth.Andrea Cantini - 1989 - Zeitshrift für Mathematische Logik Und Grundlagen der Mathematik 35 (1):97--130.
Proof Theory and Logical Complexity.Helmut Pfeifer & Jean-Yves Girard - 1989 - Journal of Symbolic Logic 54 (4):1493.

View all 11 references / Add more references