Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/164081.164110acmconferencesArticle/Chapter ViewAbstractPublication PagesissacConference Proceedingsconference-collections
Article
Free access

A zero structure theorem for exponential polynomials

Published: 01 August 1993 Publication History
First page of PDF

References

[1]
J. Ax, Schanuel's Conjecture, Ann Math 93 (1971), 252-68 A. Baker, Transcendental Number Theory, Cambridge U
[2]
niversity Press, 1975
[3]
j. Bochnak, M. Coste and M. F. Roy, Geometric Algebrique Reelle, Ergebnisse vol 12, Springer-Verlag, 1987.
[4]
B. F. Caviness and M. J. Prelle, A note on algebraic independence of logarithmic and exponential constants, SIGSAM Bulletin, vol 12, no 2, pp 18-20, 1978
[5]
Cronin, J., Fixed Points and Topological Degree in Nonlinear Analysis, American Mathematical Society, 1964
[6]
B. i. Dahn, On Exponential Logarithmic Terms, Fundamenta Mathematicae, vol 127, pp 45-50, 1986
[7]
P. Gianni, B. Trager, G. Zacharias, Groebner Bases and Primary Decomposition of Polynomial Ideals, Journal of Symbolic Computation 1988, 6, pp 149-167
[8]
G.It. Hardy, Orders of Infinity, Cambridge 1910
[9]
S. Lung, Introduction to Transcendental Numbers, Addison-Wesley, 1966
[10]
N. G. Lloyd, Degree Theory, Cambridge University Press, 1978
[11]
A. Macintyre, Schanuel's Conjecture and Free Exponential Rings, preprint, Oxford 1991
[12]
D. Richardson, Finding roots of equations involving solutions of first order algebraic differential equations, pp 42%440 in Effective Methods in Algebraic Geometry, (Teo Morn and Carlo Traverso Eds), Birkhauser 1991
[13]
D.Richardson, Wu's method and the Khovanskii finiteness theorem, Journal of Symbolic Computation, 1991, 12, pp 127-141
[14]
D. Richardson, Computing the topology of a bounded non-algebraic curve in the plane, J. Symbolic Computation 14, 1992, pp 619-643
[15]
D.Richardson, The Elementary Constant Problem, ISSAC 92.
[16]
M. t~osenlicht, On Liouville's theory of elementary functions, Pacific Journal of Mathematics, vol 65, no 2, 1976, pp 485-492
[17]
B. Salvy, Asymptotique Automatique et Fonctions Generatrices, Thesis, Ecole Polytechnique
[18]
J. Shackell, Limits of Liouvillian Functions, preprint 1991
[19]
N.N. Vorobjov, Deciding consistency of systems of polynomial in exponent inequalities in subexponential time, pp 491-500 in Effective Methods in Algebraic Geometry, (Teo Morn and Carlo Traverso Eds), Birkhauser 1991
[20]
A.J. Wilkie, Some model completeness results for expansions of the ordered field of real numbers by Pfaffian functions, preprint, Mathematics Institute, Oxford.
[21]
S.C. Chou, W. F. Schelter, and J. G. Yang, Characteristic Sets and Grobner Bases in Geometry Theorem Proving, Draft, Institute for Computing Science, The University of Texas, Austin, TX 78712
[22]
Wu, W.T., Basic Principles of Mechanical Theorem Proving in Elementary Geometries, J. Sys. Sci. and Math. Scis, f(3), 1984, 207-235

Cited By

View all
  • (2003)Cited ReferencesComputer algebra handbook10.5555/940131.940137(493-622)Online publication date: 1-Jan-2003
  • (1995)A simplified method of recognizing zero among elementary constantsProceedings of the 1995 international symposium on Symbolic and algebraic computation10.1145/220346.220360(104-109)Online publication date: 1-Apr-1995
  • (1994)The identity problem for elementary functions and constantsProceedings of the international symposium on Symbolic and algebraic computation10.1145/190347.190429(285-290)Online publication date: 1-Aug-1994

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
ISSAC '93: Proceedings of the 1993 international symposium on Symbolic and algebraic computation
August 1993
321 pages
ISBN:0897916042
DOI:10.1145/164081
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1993

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

ISSAC93
Sponsor:

Acceptance Rates

Overall Acceptance Rate 395 of 838 submissions, 47%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)26
  • Downloads (Last 6 weeks)4
Reflects downloads up to 30 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2003)Cited ReferencesComputer algebra handbook10.5555/940131.940137(493-622)Online publication date: 1-Jan-2003
  • (1995)A simplified method of recognizing zero among elementary constantsProceedings of the 1995 international symposium on Symbolic and algebraic computation10.1145/220346.220360(104-109)Online publication date: 1-Apr-1995
  • (1994)The identity problem for elementary functions and constantsProceedings of the international symposium on Symbolic and algebraic computation10.1145/190347.190429(285-290)Online publication date: 1-Aug-1994

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media