Growth estimates for exp-log functions (Q803299): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1354702
Property / author
 
Property / author: John R. Shackell / rank
Normal rank
 

Revision as of 16:33, 28 February 2024

scientific article
Language Label Description Also known as
English
Growth estimates for exp-log functions
scientific article

    Statements

    Growth estimates for exp-log functions (English)
    0 references
    1990
    0 references
    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.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    rate of growth
    0 references
    exp-log functions
    0 references
    algorithm
    0 references