Given a finite family F of convex sets in R(d), we say that F has the (p,q)(r) property if for any p convex sets in F there are at least r q-tuples that have nonempty intersection. The piercing number of F is the minimum number of points we need to intersect all the sets in F. In this paper we will find some bounds for the piercing number of families of convex sets with (p,q)(r) properties.