Rekursion über Dilatoren und die Bachmann-Hierarchie

Archive for Mathematical Logic 28 (1):57-73 (1989)
  Copy   BIBTEX

Abstract

A hierarchy (J D g ) D Dilator of ordinal functionsJ D g : On→On is introduced and studied. It is a hierarchy of iterations relative to some giveng:OnarOn, defined by primitive recursion on dilators. This hierarchy is related to a Bachmann hierarchy $\left( {\phi _\alpha ^g } \right)_{\alpha< \varepsilon _{\Omega {\mathbf{ }} + {\mathbf{ }}1} }$ , which is built on an iteration ofg ↑ Ω as initial function.This Bachmann hierarchy $\left( {\phi _\alpha ^g } \right)_{\alpha< \varepsilon _{\Omega {\mathbf{ }} + {\mathbf{ }}1} }$ itself is shown to be explicitly definable by $$\phi _\alpha ^g (\eta ) = g^{\Omega ^\alpha \cdot (1 + \eta )} (0)$$ from a hierarchy of iterationsg α :Ω→Ω for weakly monotonicg: Ω→Ω withg(0)>0. Forg=λη. (1+η) ·ω org=λη. 1, in particular, one obtains as $\left( {\phi _\alpha ^g } \right)_{\alpha< \varepsilon _{\Omega {\mathbf{ }} + {\mathbf{ }}1} }$ Bachmann hierarchy.With every ordinalα≦ε Ω+1 a dilatorD α is associated.D α is “below” the dilator $$\left( {\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{2} + Id} \right)_{(\omega )}$$ , which is defined as $$\mathop {\sup }\limits_{n< \omega } (\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{2} + Id)_{(n)}$$ with (¯2+Id)(0):=1 and $$(\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{2} + Id)_{(n + 1)} : = (\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{2} + Id)^{(2 + Id)_{(n)} }$$ . For weakly monotonicg:OnarOn satisfyingg(0)>0 and $g(\Omega ) \subseteqq \Omega$ , and forη<Ω andα<ε Ω+1 it is proved that

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,932

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

Ptykes in GödelsT und Definierbarkeit von Ordinalzahlen.Peter Päppinghaus - 1989 - Archive for Mathematical Logic 28 (2):119-141.
An ordinal partition avoiding pentagrams.Jean A. Larson - 2000 - Journal of Symbolic Logic 65 (3):969-978.

Analytics

Added to PP
2013-11-23

Downloads
19 (#792,484)

6 months
5 (#836,811)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Ptykes in GödelsT und Definierbarkeit von Ordinalzahlen.Peter Päppinghaus - 1989 - Archive for Mathematical Logic 28 (2):119-141.
Embeddability of ptykes.Jean-Yves Girard & Dag Normann - 1992 - Journal of Symbolic Logic 57 (2):659-676.

Add more citations

References found in this work

[product]¹2-logic, Part 1: Dilators.Jean-Yves Girard - 1981 - Annals of Mathematical Logic 21 (2):75.
Π12-logic, Part 1: Dilators.Jean-Yves Girard - 1981 - Annals of Mathematical Logic 21 (2-3):75-219.
Set recursion and Πhalf-logic.Jean-Yves Girard & Dag Normann - 1985 - Annals of Pure and Applied Logic 28 (3):255-286.
Set recursion and [product]¹2-logic.J. Girard - 1985 - Annals of Pure and Applied Logic 28 (3):255.
Ptykes in GödelsT und Definierbarkeit von Ordinalzahlen.Peter Päppinghaus - 1989 - Archive for Mathematical Logic 28 (2):119-141.

View all 8 references / Add more references