Premium
A note on the decidability of exponential terms
Author(s) -
D'Aquino Paola,
Terzo Giuseppina
Publication year - 2007
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.200610047
Subject(s) - mathematics , modulo , exponential function , decidability , conjecture , exponential polynomial , exponential formula , double exponential function , discrete mathematics , pure mathematics , combinatorics , mathematical analysis
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 ℂ. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom