Intersection of a recognizable language and a decidable language is decidable?
It's false. Let $L_1=\Sigma^*$ be a decidable language and $L_2=L_{HALT}$ be the (recognizable) language of all halting TM-string pairs. Then $L_1\cap L_2=L_2$, which is not decidable.