In this paper we consider two different logic languages. Both of them are extensions of first order logic. The first semantics is obtained by adding a partial fixed point operator. The second semantics is based on considering a partial fixed point as a non-standard quantifier. For this two semantics we demonstrate that they have an equal expressive power. For this purpose we show how to express an arbitrary formula of one logic with a formula of another.