skip to main content
10.1145/190347.190429acmconferencesArticle/Chapter ViewAbstractPublication PagesissacConference Proceedingsconference-collections
Article
Free Access

The identity problem for elementary functions and constants

Authors Info & Claims
Published:01 August 1994Publication History

ABSTRACT

A solution for a version of the identify problem is proposed for a class of functions including the elementary functions. Given f(x), g(x), defined at some point β we decide whether or not f(x) = g(x) in some neighbourhood of β. This problem is first reduced to a problem about zero equivalence of elementary constants. Then a semi algorithm is given to solve the elementary constant problem. This semi algorithm is guaranteed to give the correct answer whenever it terminates, and it terminates unless the problem being considered contains a counterexample to Schanuel's conjecture.

References

  1. 1.J. Ax. Schanuel's conjecture. Ann Math, 93:252-268, 1971.Google ScholarGoogle Scholar
  2. 2.B. F. Caviness. On canonical forms and simplification. Journal of the A CM, 17(2):385-396, April 1970. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.J. Cronin. Fixed Points and Topological Degree in Non. linear Analysis. American Mathematical Society, 1964.Google ScholarGoogle Scholar
  4. 4.H. R. P. Ferguson and R.W. Forcade. Multidimensional euclidean algorithms. J. Reine Ange. Math, 33:171-181, 1982.Google ScholarGoogle Scholar
  5. 5.N. G. Lloyd. Degree Theory. C.U.P., 1968.Google ScholarGoogle Scholar
  6. 6.P. Moseley. CMculating topological degree. Technical report, Bath University School of Mathematical Sciences, 1993.Google ScholarGoogle Scholar
  7. 7.W. Naylor. Master's thesis, School of Mathematical Sciences, University of Bath, 1993.Google ScholarGoogle Scholar
  8. 8.M. Pohst. A modification of the LLL reduction algorithm. J. Symbolic Computation, 4:123-127, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.P. Rabinowitz, editor. Numerical Methods for Nonlinear Algebraic Equations. Gordon and Breach, 1970.Google ScholarGoogle Scholar
  10. 10.D. Richardson. Some undecidabte problems involving elementary functions of a real variable. Journal of Symbolic Logic, pages 514-520, 1968.Google ScholarGoogle Scholar
  11. 11.D. Richardson. The elementary constant problem. In Proceedings of ISSAC92, Berkeley, California. SIGSAM, ACM, July 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.D. Richardson. A zero structure theorem for exponentim systems. In Proceedings of ISSA C93, Kiev, Ukraine. SIGSAM, ACM, July 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13.M. Rosenlicht. On Liouville's theory of elementary functions. Pacific Journal of Mathematics, 65(2):485- 492, 1976.Google ScholarGoogle ScholarCross RefCross Ref
  14. 14.J. Shackell. A differential equations approach to functional equivalence. In G. Gonnet, editor, ISSAC'89, ISSAC, pages 7-10. ACM, ACM Press, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15.W. T. Wu. Basic principles of mechanical theorem proving in elementary geometries. J. Sys. Sci. and Math. Scis, f(3):207-235, 1994.Google ScholarGoogle Scholar

Index Terms

  1. The identity problem for elementary functions and constants

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        ISSAC '94: Proceedings of the international symposium on Symbolic and algebraic computation
        August 1994
        359 pages
        ISBN:0897916387
        DOI:10.1145/190347

        Copyright © 1994 ACM

        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]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 August 1994

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate395of838submissions,47%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader