On the proof theory of type two functionals based on primitive recursive operations

&
Mathematical Logic Quarterly 52 (3):237-252 (2006)
  Copy   BIBTEX

Abstract

This paper is a companion to work of Feferman, Jäger, Glaß, and Strahm on the proof theory of the type two functionals μ and E1 in the context of Feferman-style applicative theories. In contrast to the previous work, we analyze these two functionals in the context of Schlüter's weakened applicative basis PRON which allows for an interpretation in the primitive recursive indices. The proof-theoretic strength of PRON augmented by μ and E1 is measured in terms of the two subsystems of second order arithmetic, Π10-CA and Π11-CA, respectively

Categories

Keywords

Reprint years

DOI

10.1002/malq.200510029

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

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

Through your library

My notes

Similar books and articles

A decidable theory of type assignment.William R. Stirton - 2013 - Archive for Mathematical Logic 52 (5-6):631-658.
How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study.Andreas Weiermann - 1998 - Journal of Symbolic Logic 63 (4):1348-1370.
The hereditary partial effective functionals and recursion theory in higher types.G. Longo & E. Moggi - 1984 - Journal of Symbolic Logic 49 (4):1319-1332.
A theory of rules for enumerated classes of functions.Andreas Schlüter - 1995 - Archive for Mathematical Logic 34 (1):47-63.
Ramsey's Theorem for Pairs and Provably Recursive Functions.Alexander Kreuzer & Ulrich Kohlenbach - 2009 - Notre Dame Journal of Formal Logic 50 (4):427-444.
Non-definability of the Ackermann function with type 1 partial primitive recursion.Karl-Heinz Niggl - 1997 - Archive for Mathematical Logic 37 (1):1-13.
A proof of strongly uniform termination for Gödel's \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $T$\end{document} by methods from local predicativity. [REVIEW]Andreas Weiermann - 1997 - Archive for Mathematical Logic 36 (6):445-460.
A restricted computation model on Scott domains and its partial primitive recursive functionals.Karl-Heinz Niggl - 1998 - Archive for Mathematical Logic 37 (7):443-481.
Monotone majorizable functionals.Helmut Schwichtenberg - 1999 - Studia Logica 62 (2):283-289.
Equivalence of bar recursors in the theory of functionals of finite type.Marc Bezem - 1988 - Archive for Mathematical Logic 27 (2):149-160.
A characterization of the $\Sigma_1$ -definable functions of $KP\omega + $.Wolfgang Burr & Volker Hartung - 1998 - Archive for Mathematical Logic 37 (3):199-214.
On nested simple recursion.Ján Komara - 2011 - Archive for Mathematical Logic 50 (5-6):617-624.
Unary primitive recursive functions.Daniel E. Severin - 2008 - Journal of Symbolic Logic 73 (4):1122-1138.
A Diller-Nahm-style functional interpretation of $\hbox{\sf KP} \omega$.Wolfgang Burr - 2000 - Archive for Mathematical Logic 39 (8):599-604.

Analytics

Added to PP
2013-12-01

Downloads
18 (#808,169)

6 months
4 (#818,853)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Definedness.Solomon Feferman - 1995 - Erkenntnis 43 (3):295 - 320.
Totality in applicative theories.Gerhard Jäger & Thomas Strahm - 1995 - Annals of Pure and Applied Logic 74 (2):105-120.

View all 7 references / Add more references