Self doubt- REC and RL

Question

What is the intersection between recursive and recursive enumerable language?

And also intersection between recursive and non-REL languages

Answer 1

As every RE is REL but opposite is not true , So RE intersection REL will be RE .

Now If a Language is not REL , then by no chance can it be RE . So intersection shall be an empty set.

Correct e if I went wrong somewhere.

Comments

So what is the intersection between recursive and the complement of recursively enumerable language?

---

Complement of strict REL is non -recursive enumerable , but since every RE is REL and complement of RE is RE , so intersection of RE and RELc shall be RE itself , since in the RELc only those languages would remain which are either strictly RE or not even REL .