We introduce a logic with approximate reasoning as a modification of the probability logic LPP introduced by Rašković in [7]. The usual probability logics have probabilistic quantifiers, whereas we have probability operators that behave like a kind of modal operators. The main improvement here is a new axiom which ensures that probable premises will yield a probable conclusion. Using techniques introduced in [6], a completeness theorem is proved.