A random vector =(X1,…, Xn) is conditionally weakly associated if and only if for every pair of partitions 1=(X$pi$(k+1),…,X$pi$(k)), 2=(X$pi$(k+1),…,X$pi$(n)) of P(1$in$A│2$in$B, $ heta$$in$I) $geq$P$in$A│$ heta$$in$I whenever A and B are open upper sets and $pi$ is any permutation of {1,…,n}. In this note we develop some concepts of conditional positive dependence, which are weaker than conditional weak association but stronger than conditional positive orthant dependence, by requiring the above inequality to hold only for some upper sets and applying the arguments in Shaked (1982).