Self Doubt on Theory of Computation

Question

What is the intersection of recursive and recursively enumerable language?

Answer 1

Recursively enumerable

Recursively enumerable languages are closed under intersection, all recursive languages are also recursively enumerable. So $$\text{R.E } \bigcap \text{ R.E} = \text{ R.E}$$

Comments

Thanks @zxy123