kevinjh wrote:
Ah, so that was the resolution of the problem in a figurative nutshell!

Yes, that's the most common hack to make it work. Given any property P, you can define the
class of all sets that have property P. But not all classes are sets. A class is a set if and only if it is a member of a class. A class that is not a set is called a proper class. This system of logic, called NBG, does not have any paradoxes in it, as far as we know.
Theorem.
Every natural number can be named in under twenty words.
Proof.
Suppose not. Let N be the first natural number that cannot be named in under twenty words. But I just named it in twelve words!
Theorem.
Every natural number is interesting.
Proof.
Suppose not. Let N be the first natural number that isn't interesting. That's pretty interesting, isn't it?