My mathematical prejudices: 1. I don't accept choice on the continuum 2. I accept choice on countable collections, as well as countable infinity. 3. I don't think of the continuum as small enough to be a set, 4. I think every subclass (subset) of the real line is measurable, 5. I prefer constructions to abstractions. In this, I hope I am following Paul Cohen in spirit.
my dream theorem is a proof of the consistency of ZFC from a countable computable ordinal, as explicitly describable as possible, which plays the same role for ZFC as $\epsilon_0$ does for PA. This would complete Hilbert's program, giving what I would consider a finitary proof of the consistency of set theory. If you think this is impossible because of Godel's theorem, you haven't understood Godel's theorem fully. The problem is that ordinal naming schemes crap out much too early for this to work with an explicit construction with today's methods.
Top Network Posts
- 163Why does kinetic energy increase quadratically, not linearly, with speed?
- 93Proving you *can't* make $2011$ out of $1,2,3,4$: nice twist on the usual
- 69Reading the Feynman lectures in 2012
- 66Why do we not have spin greater than 2?
- 43Does Gödel preclude a workable ToE?
- 43What's wrong with this derivation that $i\hbar = 0$?
- 43What happened to David John Candlin?
- View more network posts →