Growth estimates for exp-log functions (Q803299)

exp-log functions are functions build from the constant 1, the arithmetic operations \(+,-,\times,\div\) and the functions exp() and log\(| |\). These functions are linearly ordered by the ordering \(f>g\) if \(f(x)>g(x)\) for all x large enough. This paper gives an algorithm to reduce the decision whether \(f>g\) to the decision whether \(f=0\) for constant functions f.