1. The problem statement, all variables and given/known data Suppose T is recursively enumerable. Show that T is actually axiomatizable (there is a recursive set P such that Theory of P = T). 3. The attempt at a solution The converse of the question is easy to show, by using compactness. But I have no idea how to do this one.