Author/Authors :
Leivant D.We show that a function over {0، نويسنده , , 1}* is poly-time iff it is computed by an equational program which can be proved to be everywhere converging in constructive second-order logic with set-existence (comprehension) restricted to positive quantifier، نويسنده ,
