The set of all recursively enumerable languages is

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.