1,233 reputation
67
bio website
location New York City
age 41
visits member for 3 years, 2 months
seen 23 hours ago

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.


1,233 Reputation

-2 Jan 12
10 Nov 8 '14
10 Oct 29 '14
-2 Oct 24 '14
10 Oct 2 '14
10 Sep 14 '14
10 Aug 22 '14
10 Aug 11 '14
10 Jul 17 '14
10 Jun 18 '14
-2 May 30 '14
-2 Apr 25 '14
-2 Apr 23 '14
10 Apr 19 '14
0 Apr 17 '14
10 Dec 20 '13
10 Dec 6 '13
10 Nov 9 '13
10 Oct 30 '13
10 Oct 7 '13
30 Jul 25 '13
10 Jul 21 '13
10 Jul 8 '13
10 Jun 10 '13
10 May 8 '13
10 Apr 15 '13
-10 Apr 10 '13
10 Mar 21 '13
10 Feb 10 '13
10 Feb 4 '13