Induktive Definitionen und Dilatoren

Archive for Mathematical Logic 27 (1):51-60 (1988)
  Copy   BIBTEX

Abstract

In this paper we give a new and comparatively simple proof of the following theorem by Girard [1]:“If ∀x∈ ${\cal O}$ ∃y∈ ${\cal O}$ ψ(x,y) (where the relationψ is arithmetic and positive in Kleene's ${\cal O}$ ), then there exists a recursive DilatorD such that ∀α≧ω∀x∈ ${\cal O}$ <α∃y∈ ${\cal O}$

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

Proof Mining in Topological Dynamics.Philipp Gerhardy - 2008 - Notre Dame Journal of Formal Logic 49 (4):431-446.
Semantics-based Nonmonotonic Inference.Heinrich Wansing - 1995 - Notre Dame Journal of Formal Logic 36 (1):44-54.
Rekursion über Dilatoren und die Bachmann-Hierarchie.Peter Päppinghaus - 1989 - Archive for Mathematical Logic 28 (1):57-73.
Resolution calculus for the first order linear logic.Grigori Mints - 1993 - Journal of Logic, Language and Information 2 (1):59-83.

Analytics

Added to PP
2013-11-23

Downloads
17 (#867,741)

6 months
1 (#1,469,946)

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

Proof theory.K. Schütte - 1977 - New York: Springer Verlag.
[product]¹2-logic, Part 1: Dilators.Jean-Yves Girard - 1981 - Annals of Mathematical Logic 21 (2):75.
Set recursion and Πhalf-logic.Jean-Yves Girard & Dag Normann - 1985 - Annals of Pure and Applied Logic 28 (3):255-286.
Introduction to?2 1 -logic.Jean-Yves Girard - 1985 - Synthese 62 (2):191-216.
Introduction to ?2 1 -logic.Jean-Yves Girard - 1985 - Synthese 62 (2):191-216.

View all 8 references / Add more references