9,521 reputation
22171
bio website math.berkeley.edu/~schweber
location
age
visits member for 5 years, 1 month
seen 12 hours ago

A graduate student at UC-Berkeley, interested in mathematical logic - specifically, computability theory and reverse mathematics, set theory, and abstract model theory. I'm also interested in other Nifty Things, in mathematics and elsewhere.


14h
comment Uncountable set and uncountable accumulations
Your question is off-topic because this site is specifically for research-level mathematics, as explained in the "help" section (mathoverflow.net/help/on-topic). Your question would be a better fit at math.stackexchange, although if you ask it there you should put a little more work into the question - explain what you've tried and where you got stuck in a little more detail..
1d
awarded  Nice Question
Aug
30
comment Non-standard numbers and exponential form of Zeta function
I'm curious, why is $\Omega$ assumed to have the form $2\tau$ for some "purely nonstandard" $\tau$?
Aug
27
answered Precise interpretability strength of $\mathcal P_{DF}(\omega)$ and $L_{\omega_1^{CK}}$
Aug
15
asked A Banach-Tarski game
Aug
7
comment Reverse of a termspace forcing fact
For those like me who have not heard of termspace forcing, see mihahabic.wordpress.com/tag/termspace-forcing
Aug
5
comment Are limits decidable? Should definitions be decidable?
Now there is a question, but I don't understand what it means. What would you consider a satisfactory answer?
Aug
3
awarded  Yearling
Jul
31
answered History of unstable formulas
Jul
30
accepted On the global structure of the Gromov-Hausdorff metric space
Jul
30
comment On the global structure of the Gromov-Hausdorff metric space
This is very nice, thank you!
Jul
30
awarded  Nice Question
Jul
29
revised The status of 'the consistency of NF relative to ZF'
added 69 characters in body
Jul
28
revised The status of 'the consistency of NF relative to ZF'
added 37 characters in body
Jul
28
comment The status of 'the consistency of NF relative to ZF'
Oh, I was not aware of this - does he believe his argument may be fixable?
Jul
28
awarded  Necromancer
Jul
28
awarded  Revival
Jul
28
answered The status of 'the consistency of NF relative to ZF'
Jul
28
comment Class forcings and elementary embeddings
(But I might be misunderstanding what you're asking - what do you mean by "relativized to a predicate"?)
Jul
28
comment Class forcings and elementary embeddings
@ThomasBenjamin Certainly not - for example, consider the trivial forcing extension $V[G]=V$. Truth in $V$ is very much not definable in $V[G]$. :P More generally, I suspect that it is much harder (if possible at all) to build a class- or set-generic extension $V[G]$ in which $Th(V)$ is definable. (Note that there's an apparent proof of impossibility: since the forcing relation is definable in $V$, shouldn't $Th(V[G], G)$ be definable in $V[G]$ from the parameter $G$ if $Th(V)$ is definable in $V[G]$? However, this breaks down since the forcing relation is not uniformly definable.)