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.
A note on the decidability of exponential terms / D'Aquino, P.; Terzo, G.. - In: MATHEMATICAL LOGIC QUARTERLY. - ISSN 0942-5616. - 53:3(2007), pp. 306-310. [10.1002/malq.200610047]
A note on the decidability of exponential terms
D'Aquino P.;Terzo G.
2007
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 ℂ. © 2007 WILEY-VCH Verlag GmbH & Co. KGaA.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
