Is the superset and subset of a semi-decidable language also semi-decidable?
No, because every language $L$ satisfies $$ \emptyset \subseteq L \subseteq \Sigma^* $$ and $\emptyset$ and $\Sigma^*$ are both semi-decidable.