Bounds for the closure ordinals of replete monotonic increasing functions

DOI10.2307/2272156zbMath0325.02019OpenAlexW2064130317MaRDI QIDQ4088794

Diana Schmidt

Publication date: 1975

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2272156

Mathematics Subject Classification ID

Recursive ordinals and ordinal notations (03F15)

Related Items

A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH ⋮ Natural well-orderings ⋮ Well-Partial Orderings and their Maximal Order Types ⋮ Well-partial-orderings and the big Veblen number ⋮ An ordinal bound for the set of polynomial functions with exponentiation ⋮ Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results ⋮ Calculating Maximal Order Types for Finite Rooted Unstructured Labeled Trees ⋮ Bounds for the closure ordinals of essentially monotonic increasing functions

Cites Work

• Unnamed Item
• Kennzeichnung von Ordnungszahlen durch rekursiv erklärte Funktionen
• Systems of predicative analysis, II: Representations of ordinals