The purpose of this work is two-fold. First, we present some consequences of the Covering Property Axiom CPA of Ciesielski and Pawlikowski which captures the combinatorial core of the Sacks\u27 model of the set theory. Second, we discuss the assumptions in the formulation of different versions of CPA.;As our first application of CPA we prove that under the version CPAgamecube of CPA there are uncountable strong gamma-sets on R . It is known that Martin\u27s Axiom (MA) implies the existence of a strong gamma-set on R . Our result is interesting since that CPAgamecube implies the negation of MA.;Next, we use the version CPAgameprism of CPA to construct some special ultrafilters on Q . An ultrafilter on Q is crowded provided ...