Hyperations, Veblen progressions and transfinite iteration of ordinal functions

DOI10.1016/J.APAL.2013.01.002MaRDI QIDQ385073zbMATH OpenOpenAlexWikidataFDO

Authors David Fernández-Duque, Joost J. Joosten

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

zbMATH Keywords

normal functionsadjointcohyperationordinal functionstransfinite iterationVeblen progressions

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Total orders (06A05) Ordinal and cardinal numbers (03E10) Recursive ordinals and ordinal notations (03F15)

Abstract: In this paper we introduce hyperations and cohyperations, which are forms of transfinite iteration of ordinal functions. Hyperations are iterations of normal functions. Unlike iteration by pointwise convergence, hyperation preserves normality. The hyperation of a normal function f is a sequence of normal functions so that f^0= id, f^1 = f and for all ordinals alpha, �eta we have that f^(alpha + �eta) = f^alpha f^�eta. These conditions do not determine f^alpha uniquely; in addition, we require that the functions be minimal in an appropriate sense. We study hyperations systematically and show that they are a natural refinement of Veblen progressions. Next, we define cohyperations, very similar to hyperations except that they are left-additive: given alpha, �eta, f^(alpha + �eta)= f^�eta f^alpha. Cohyperations iterate initial functions which are functions that map initial segments to initial segments. We systematically study cohyperations and see how they can be employed to define left inverses to hyperations. Hyperations provide an alternative presentation of Veblen progressions and can be useful where a more fine-grained analysis of such sequences is called for. They are very amenable to algebraic manipulation and hence are convenient to work with. Cohyperations, meanwhile, give a novel way to describe slowly increasing functions as often appear, for example, in proof theory.

Recommendations

• Veblen hierarchy
• Built-up systems of fundamental sequences and hierarchies of number-theoretic functions
• Functors and ordinal notations. I: A functorial construction of the veblen hierarchy
• Fruitful and helpful ordinal functions
• A simplified functorial construction of the veblen hierarchy

Cites work

• scientific article; zbMATH DE number 3572133 (Why is no real title available?)
• Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
• Functors and ordinal notations. I: A functorial construction of the veblen hierarchy
• Hierarchies of number-theoretic functions II
• Natural well-orderings
• Phase transitions for Gödel incompleteness
• Proof theory. The first step into impredicativity
• Provability algebras and proof-theoretic ordinals. I
• Slow consistency
• Systems of predicative analysis, II: Representations of ordinals
• Turing progressions and their well-orders
• Well-orders in the transfinite Japaridze algebra

Cited in

(10)

• scientific article; zbMATH DE number 152059 (Why is no real title available?)
• Veblen hierarchy
• Iterability for (transfinite) stacks
• A topological completeness theorem for transfinite provability logic
• The logic of Turing progressions
• On provability logics with linearly ordered modalities
• Deducibility and independence in Beklemishev's autonomous provability calculus
• Strong completeness of provability logic for ordinal spaces
• Turing-Taylor expansions for arithmetic theories
• The polytopologies of transfinite provability logic

This page was built for publication: Hyperations, Veblen progressions and transfinite iteration of ordinal functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385073)