Kennzeichnung von Ordnungszahlen durch rekursiv erklärte Funktionen
From MaRDI portal
Publication:2651619
DOI10.1007/BF01361109zbMath0055.04902OpenAlexW2314560038MaRDI QIDQ2651619
Publication date: 1954
Published in: Mathematische Annalen (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/160361
Related Items (22)
Ein konstruktives system von Ordinalzahlen ⋮ Eine Erweiterung T(V') des Ordinalzahlensystems \(C_{\Omega}(\Lambda _ 0)\) von G. Jäger. (An extension T(V') of the ordinal system \(C_{\Omega}(\Lambda _ 0)\) by G. Jäger) ⋮ Systems of predicative analysis ⋮ The proof-theoretic analysis of \(\Sigma_{1}^{1}\) transfinite dependent choice ⋮ Natural well-orderings ⋮ A characterization of Takeuti's ordinal diagrams of finite order ⋮ Type-theoretic approaches to ordinals ⋮ Well-Partial Orderings and their Maximal Order Types ⋮ Bounds for the closure ordinals of replete monotonic increasing functions ⋮ A Survey on Ordinal Notations Around the Bachmann-Howard Ordinal ⋮ Fruitful and helpful ordinal functions ⋮ Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory ⋮ Well-partial-orderings and the big Veblen number ⋮ A Survey on Ordinal Notations Around the Bachmann–Howard Ordinal ⋮ An extension of Schütte's Klammersymbole ⋮ A flexible type system for the small Veblen ordinal ⋮ Reflections on reflections in explicit mathematics ⋮ … and so on: Schütte on Naming Ordinals ⋮ Calculating Maximal Order Types for Finite Rooted Unstructured Labeled Trees ⋮ Beziehungen des Ordinalzahlensystems OT(ϑ) zur Veblen-Hierarchie ⋮ Systems of predicative analysis, II: Representations of ordinals ⋮ P.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence Property
Cites Work
This page was built for publication: Kennzeichnung von Ordnungszahlen durch rekursiv erklärte Funktionen