How is uncountability characterized in second order logic?
A set is infinite if it can be put in one-to-one correspondence with one of its proper subsets. A set is countably infinite if it is infinite and it can be put in one-to-one correspondence with every one of its infinite subsets. A set is uncountably infinite if it is infinite but not countably infinite.
Separate names with a comma.