Recursive Non-Closure Under Right Quotient

Recursive languages are not closed under right quotient. This follows from the stronger counterexample for right quotient by a regular language, since every regular language is recursive.

theorem Recursive_notClosedUnderRightQuotient : ¬ClosedUnderRightQuotient is_Recursive

Recursive languages are not closed under right quotient.