We show here that the first order theory of the positive integers equi
pped with multiplication remains decidable when one adds to the langua
ge the usual order restricted to the prime numbers. We see moreover th
at the complexity of the latter theory is a tower of exponentials, of
height O(n).