Access the full text.
Sign up today, get DeepDyve free for 14 days.
Harvey Gerber (1967)
An extension of Schütte's KlammersymbolsMathematische Annalen, 174
Peter Päppinghaus (1985)
Pi2-models of extensions of Kripke-Platek set theory
J.-Y. Girard (1981)
II 2 1 -logic, Part 1: DilatorsAnn. Math. Logic, 21
V. Abrusci (1989)
Some uses of dilators in combinatorial problemsArchive for Mathematical Logic, 29
H.R. Jervell (1985)
Recursion on homogeneous treesZ. Math. Logik Grundlagen Math., 31
H. Bachmann (1950)
Die Normalfunktionen und das Problem der ausgezeichneten Folgen von OrdnungszahlenVierteljahresschrift der Naturforschenden Gesellschaft in Zürich, 95
J.-Y. Girard (1987)
II 2 1 -logic and related topicsProceedings of the conferences on mathematical logic (Siena, 1985; Padova, 1985 and Siena, 1986), 3
J. Vauzeilles (1985)
Functors and ordinal notations. IV: The Howard ordinal and the functor ∧.Journal of Symbolic Logic, 50
J. Girard, J. Vauzeilles (1984)
Functors and ordinal notations. II: A functorial construction of the Bachmann hierarchyJournal of Symbolic Logic, 49
Peter Päppinghaus (1989)
Ptykes in GödelsT und Definierbarkeit von OrdinalzahlenArchive for Mathematical Logic, 28
Jane Bridge (1975)
A simplification of the Bachmann method for generating large countable ordinalsJournal of Symbolic Logic, 40
Herman Jervell (1985)
Recursion on Homogeneous TreesMath. Log. Q., 31
J. Girard, Jacqueline Vauzeilles (1984)
Les premiers recursivement inaccessible et Mahlo et la theorie des dilatateursArchiv für mathematische Logik und Grundlagenforschung, 24
J. Vauzeilles (1982)
Functors and Ordinal Notations III - Dilators and GardensStudies in logic and the foundations of mathematics, 107
J.-Y. Girard, D. Normann (1985)
Set recursion and II 1 2 -logicAnn. Pure Appl. Logic, 28
J. Girard, D. Normann (1985)
Set recursion and Πhalf-logicAnn. Pure Appl. Log., 28
J. Vauzeilles (1982)
Proceedings of the Herbrand Symposium
P. Päppinghaus (1987)
Logic Colloquium '85
J. Girard (1981)
Π12-logic, Part 1: DilatorsAnnals of Mathematical Logic, 21
P. Aczel (1972)
Describing ordinals using functionals of transfinite typeJournal of Symbolic Logic, 37
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.
Archive for Mathematical Logic – Springer Journals
Published: Apr 20, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.