If a language is context free, then its complement is decidable
If $L$ is context free, it is decidable. Thus so is it's complement (to see if $\sigma \in L^c$, check if it is in $L$ and answer the opposite).

$L \cap L^c = \varnothing$, which is certainly decidable (just say no).

Your question is seriously confused...