Sep. 26th, 2004

sniffnoy: (Golden Apple)
An apparent paradox:

Consider the class of all undefinable ordinals. Assume it is nonempty. It therefore has a least element. However, this least element can be defined as the least undefinable ordinal, and is thus definable! Therefore the class is empty, and all ordinals are definable. But, as the ordinals are very definitely not countable, there must be undefinable ordinals.

I came up with this a few days ago, and it hurt my head for quite a while. I asked Josh about this, naturally enough, and he was, in fact, able to resolve the paradox for me very quickly; I could post the resolution here, but I'd rather just hurt all your heads for a few days. :D (Well, those of you who can't figure it out, anyway.)

-Sniffnoy

--
There are 2 possible numbers of sources for a quote: 0 and infinity.

February 2026

S M T W T F S
1234567
891011121314
15161718192021
22 23 2425262728
Page generated Mar. 13th, 2026 09:22 am
Powered by Dreamwidth Studios