An ordinal bound for the set of polynomial functions with exponentiation
From MaRDI portal
Publication:1245856
DOI10.1007/BF02485393zbMath0376.06001MaRDI QIDQ1245856
Publication date: 1978
Published in: Algebra Universalis (Search for Journal in Brave)
Total orders (06A05) Other classical set theory (including functions, relations, and set algebra) (03E20)
Related Items (4)
ASYMPTOTIC ANALYSIS OF SKOLEM’S EXPONENTIAL FUNCTIONS ⋮ Meeting of the Association for Symbolic Logic, Marseilles, 1981 (the Herbrand Symposium) ⋮ Skolem + Tetration Is Well-Ordered ⋮ Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\)
Cites Work
- Unnamed Item
- Polynomial functions with exponentiation are well ordered
- An initial segment of the set of polynomial functions with exponentiation
- Bounds for the closure ordinals of replete monotonic increasing functions
- An ordered set of arithmetic functions representing the least ε‐number
- Associative Ordinal Functions, Well Partial Orderings and a Problem of Skolem
- Systems of predicative analysis
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Solution of the identity problem for integral exponential functions
- Arithmetic of ordinals with applications to the theory of ordered Abelian groups
This page was built for publication: An ordinal bound for the set of polynomial functions with exponentiation
