Reducible language ( Decidability)

Question

 

Comments

$M$ is reducible to $L$, so $M$ can be recursive enumerable. So, $M\bigcap L$ is not recursive always.

Correct me if i'm wrong.

---

See we get that L is R.E.L and may or may not be Recursive though

Now if M <= L (Say L i assumed as Recursive)

then M will also be recursive then : M intersection L = Recursive intersection Recursive = Recursive

If I assume L as Recursively enumerable but not recusive and M is reducible to L them M can be recursive

So M intersection L will be Recusively enumerable not recursive

---

thanks