Rekursion über Dilatoren und die Bachmann-Hierarchie. (Recursion over dilators and the Bachmann hierarchy)

DOI10.1007/BF01624083zbMath0675.03033MaRDI QIDQ1121880

Peter Paeppinghaus

Publication date: 1989

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

zbMATH Keywords

primitive recursionBachmann-Howard ordinaldilatorsBachmann hierarchy

Mathematics Subject Classification ID

Recursive ordinals and ordinal notations (03F15) Hierarchies of computability and definability (03D55)

Related Items (2)

Embeddability of ptykes ⋮ Ptykes in Gödels T und Definierbarkeit von Ordinalzahlen. (Ptykes in Gödel's T and definability of ordinal numbers)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some uses of dilators in combinatorial problems. III: Independence results by means of decreasing F-sequences (F weakly finite dilator)
• Set recursion and \(\Pi ^ 1_ 2\)-logic
• Ptykes in Gödels T und Definierbarkeit von Ordinalzahlen. (Ptykes in Gödel's T and definability of ordinal numbers)
• An extension of Schütte's Klammersymbole
• Les premiers recursivement inaccessible et Mahlo et la theorie des dilatateurs
• Recursion on Homogeneous Trees
• Functors and ordinal notations. II: A functorial construction of the Bachmann hierarchy
• Functors and ordinal notations. IV: The Howard ordinal and the functor ∧.
• Π12-logic, Part 1: Dilators
• A simplification of the Bachmann method for generating large countable ordinals
• Describing ordinals using functionals of transfinite type

This page was built for publication: Rekursion über Dilatoren und die Bachmann-Hierarchie. (Recursion over dilators and the Bachmann hierarchy)