Hyperations, Veblen progressions and transfinite iteration of ordinal functions
From MaRDI portal
Publication:385073
DOI10.1016/J.APAL.2013.01.002zbMath1383.03055arXiv1205.2036OpenAlexW2143956643WikidataQ58883293 ScholiaQ58883293MaRDI QIDQ385073
Joost J. Joosten, David Fernández-Duque
Publication date: 29 November 2013
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.2036
Total orders (06A05) Recursive ordinals and ordinal notations (03F15) Ordinal and cardinal numbers (03E10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items (7)
The logic of Turing progressions ⋮ Deducibility and independence in Beklemishev's autonomous provability calculus ⋮ A topological completeness theorem for transfinite provability logic ⋮ On provability logics with linearly ordered modalities ⋮ The polytopologies of transfinite provability logic ⋮ Turing-Taylor expansions for arithmetic theories ⋮ STRONG COMPLETENESS OF PROVABILITY LOGIC FOR ORDINAL SPACES
Cites Work
- Unnamed Item
- Proof theory. The first step into impredicativity
- Phase transitions for Gödel incompleteness
- Provability algebras and proof-theoretic ordinals. I
- Slow consistency
- Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
- Turing Progressions and Their Well-Orders
- Functors and ordinal notations. I: A functorial construction of the veblen hierarchy
- Natural well-orderings
- Well-orders in the transfinite Japaridze algebra
- Systems of predicative analysis, II: Representations of ordinals
- Hierarchies of number-theoretic functions II
This page was built for publication: Hyperations, Veblen progressions and transfinite iteration of ordinal functions
