Polynomial functions with exponentiation are well ordered

DOI10.1007/BF02945125zbMath0308.06001OpenAlexW1989505075MaRDI QIDQ1218443

Andrzej Ehrenfeucht

Publication date: 1973

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02945125

Mathematics Subject Classification ID

Total orders (06A05) Other classical set theory (including functions, relations, and set algebra) (03E20)

Related Items

Unnamed Item, ASYMPTOTIC ANALYSIS OF SKOLEM’S EXPONENTIAL FUNCTIONS, Equational theory of positive numbers with exponentiation is not finitely axiomatizable, Meeting of the Association for Symbolic Logic, Marseilles, 1981 (the Herbrand Symposium), Skolem + Tetration Is Well-Ordered, A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets, A notion of mechanistic theory, An ordinal bound for the set of polynomial functions with exponentiation, An initial segment of the set of polynomial functions with exponentiation, Unnamed Item, Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\), Growth estimates for exp-log functions

Cites Work

• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Solution of the identity problem for integral exponential functions