31 Summary and outline of the Proof Computability of the set of axioms and completeness of the theory T are two goals that cannot be met together, because: The set Th(N) is not even definable by an arithmetic sentence (that would be true if its number were in the set and false if not): Let n be a number such that n  Th(N).
{}