Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. EHRENFEUCHT: Polynomial functions with exponentiation are well ordered. Algebra Universalis 3 (1973), pp. 261–262.
J.B. KRUSKAL: Well-quasi-ordering, the tree theorem, and Vazsonyi's conjecture. Trans. Amer. Math. Soc. 95 (1960), pp. 210–225.
H. LEVITZ: An ordered set of arithmetic functions representing the least ε-number. Zeitschr. f. math. Logik und Grundlagen d. Math. Bd. 21, S115–120 (1975).
H. LEVITZ: An ordinal bound for the set of polynomial functions with exponentiation. Algebra Universalis 8 (1978), 233–243.
H. LEVITZ: Decidability of some problems pertaining to base 2 exponential diophantine equations. To appear, Zeitschr. f. math. Logik und Grundlagen d. Math.
R. McBETH: Fundamental squences for exponential polynomials. Zeitschr. f. math. Logik und Grundlagen d. Math. Bd. 26, S115–122 (1980).
D. RICHARDSON: Solution of the identity problem for integral exponential functions. Zeitschr. f. math. Logik und Grundlagen d. Math. Bd. 15, S. 333–340 (1969).
TH. SKOLEM: An ordered set of arithmetic functions representing the least ε-number. DET KONGELIGE NORSKE VIDENSKABERS SELKABS FORHANDLINGER Bind 29 (1956) Nr. 12.
P.H. SLESSENGER: A height restricted generation of a set of arithmetic functions of order-type ε0. To appear, Zeitschr. f. math. Logik und Grundlagen d. Math.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag
About this paper
Cite this paper
Slessenger, P.H. (1984). On subsets of the Skolem class of exponential polynomials. In: Börger, E., Oberschelp, W., Richter, M.M., Schinzel, B., Thomas, W. (eds) Computation and Proof Theory. Lecture Notes in Mathematics, vol 1104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0099495
Download citation
DOI: https://doi.org/10.1007/BFb0099495
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13901-0
Online ISBN: 978-3-540-39119-7
eBook Packages: Springer Book Archive