Vereinfachte Kollabierungsfunktionen und ihre Anwendungen

Archive for Mathematical Logic 31 (2):85-94 (1991)
  Copy   BIBTEX

Abstract

In this article we define a new and transparent concept of total collapsing functions for an ordinal notation system which is characteristic for the theory (Δ 2 1 -CA)+(BI). We show that our construction allows the application of Pohler's method of local predicativity as presented in [2] which yields a perspicious proof-theoretic analysis of (Δ 2 1 -CA)+(BI) being not much more complicated than for ID1

Categories

Keywords

Reprint years

DOI

10.1007/bf01387761

Links

PhilArchive



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

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 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.
How to characterize provably total functions by local predicativity.Andreas Weiermann - 1996 - Journal of Symbolic Logic 61 (1):52-69.
A uniform approach for characterizing the provably total number-theoretic functions of KPM and its subsystems.Benjamin Blankertz & Andreas Weiermann - 1999 - Studia Logica 62 (3):399-427.
Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones. [REVIEW]Andreas Weiermann - 1995 - Archive for Mathematical Logic 34 (5):313-330.
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.
Variations on a theme by Weiermann.Toshiyasu Arai - 1998 - Journal of Symbolic Logic 63 (3):897-925.
Das deduktive Relevanzkriterium von Stephan Körner und seine wissenschaftstheoretischen Anwendungen.Gerhard Schurz - 1983 - Grazer Philosophische Studien 20 (1):149-177.
How to develop Proof‐Theoretic Ordinal Functions on the basis of admissible ordinals.Michael Rathjen - 1993 - Mathematical Logic Quarterly 39 (1):47-54.
A Buchholz Derivation System for the Ordinal Analysis of KP + Π₃-Reflection.Markus Michelbrink - 2006 - Journal of Symbolic Logic 71 (4):1237 - 1283.
Ordinal diagrams for Π3-reflection.Toshiyasu Arai - 2000 - Journal of Symbolic Logic 65 (3):1375 - 1394.
Collapsing functions based on recursively large ordinals: A well-ordering proof for KPM. [REVIEW]Michael Rathjen - 1994 - Archive for Mathematical Logic 33 (1):35-55.
Ordinal diagrams for recursively Mahlo universes.Toshiyasu Arai - 2000 - Archive for Mathematical Logic 39 (5):353-391.
Proof-theoretic analysis of KPM.Michael Rathjen - 1991 - Archive for Mathematical Logic 30 (5-6):377-403.
Ordinal arithmetic with simultaneously defined theta‐functions.Andreas Weiermann & Gunnar Wilken - 2011 - Mathematical Logic Quarterly 57 (2):116-132.

Analytics

Added to PP
2013-11-23

Downloads
20 (#723,940)

6 months
5 (#544,079)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Proof theory.K. Schütte - 1977 - New York: Springer Verlag.
Proof-theoretic analysis of KPM.Michael Rathjen - 1991 - Archive for Mathematical Logic 30 (5-6):377-403.
Ordinal notations based on a weakly Mahlo cardinal.Michael Rathjen - 1990 - Archive for Mathematical Logic 29 (4):249-263.

Add more references