A note on the decidability of exponential terms

Mathematical Logic Quarterly 53 (3):306-310 (2007)
  Copy   BIBTEX

Abstract

In this paper we prove, modulo Schanuel's Conjecture, that there are algorithms which decide if two exponential polynomials in π are equal in ℝ and if two exponential polynomials in π and i coincide in ℂ

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,038

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On roots of exponential terms.Helmut Wolter - 1993 - Mathematical Logic Quarterly 39 (1):96-102.
Consequences of Schanuel's condition for zeros of exponential terms.Helmut Wolter - 1993 - Mathematical Logic Quarterly 39 (1):559-565.
Real Closed Exponential Subfields of Pseudo-Exponential Fields.Ahuva C. Shkop - 2013 - Notre Dame Journal of Formal Logic 54 (3-4):591-601.
Schanuel's conjecture and free exponential rings.Angus Macintyre - 1991 - Annals of Pure and Applied Logic 51 (3):241-246.
A Note on the Axioms for Zilber’s Pseudo-Exponential Fields.Jonathan Kirby - 2013 - Notre Dame Journal of Formal Logic 54 (3-4):509-520.
Henson and Rubel's theorem for Zilber's pseudoexponentiation.Ahuva C. Shkop - 2012 - Journal of Symbolic Logic 77 (2):423-432.
Diophantine equivalence and countable rings.Alexandra Shlapentokh - 1994 - Journal of Symbolic Logic 59 (3):1068-1095.
The Field of LE-Series with a Nonstandard Analytic Structure.Ali Bleybel - 2011 - Notre Dame Journal of Formal Logic 52 (3):255-265.

Analytics

Added to PP
2013-12-01

Downloads
16 (#908,012)

6 months
5 (#641,756)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references