Q. The set of all recursively enumerable languages is
A. closed under complementation.
B. closed under intersection.
C. a subset of the set of all recursive languages.
D. an uncountable set.
Ans: closed under intersection.
![Determine the correctness (or otherwise) of the following Assertion [A] and the Reason [R]](https://www.gkseries.com/blog/wp-content/uploads/2023/10/Determine-the-correctness-or-otherwise-of-the-following-Assertion-A-and-the-Reason-R.jpg)
We will be happy to hear your thoughts