In this paper we prove, modulo Schanuel’s Conjecture, that there are algorithms which decide if two exponential polynomials in \pi are equal in R and if two exponential polynomials in \pi and i coincide in C.
A note on the decidability of exponential terms
D'AQUINO, Paola;TERZO, Giuseppina
2007
Abstract
In this paper we prove, modulo Schanuel’s Conjecture, that there are algorithms which decide if two exponential polynomials in \pi are equal in R and if two exponential polynomials in \pi and i coincide in C.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.
