9,099 reputation
11968
bio website math.berkeley.edu/~schweber
location
age
visits member for 4 years, 11 months
seen 20 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.


Jun
24
awarded  Nice Answer
Jun
22
answered Pseudo-decision procedures for first order arithmetic
Jun
18
comment example of non computable implicit operations
Could you define your terms to make this question more accessible?
Jun
18
awarded  Nice Question
Jun
18
comment Just a little absoluteness might be cheaper?
A weird aside: Bagaria and Friedman also show that $\Sigma^1_3$-absoluteness for proper forcings implies that either $\omega_1$ is Mahlo in $L$ or $\omega_2$ is inaccessible in $L$.
Jun
18
answered Just a little absoluteness might be cheaper?
Jun
17
comment What would you do if you improve your own result that is submitted but not publishied?
I think sending the editor an email explaining your specific situation, and asking how to proceed, can't be a bad idea . . .
Jun
17
comment Topological tameness beyond the Gandy-Harrington topology
I'm probably just tired, but: why is $\mathcal{O}^x_2$ $\Sigma^1_2$? Since $x$ is $\Delta^1_2$ the best I can see is $\Sigma^1_2(\Delta^1_2)=\Sigma^1_3$.
Jun
16
asked Topological tameness beyond the Gandy-Harrington topology
Jun
12
comment Just a little absoluteness might be cheaper?
Of course you're right, I left out a clause - $\mathbb{P}$ was specifically meant to be Cohen forcing in that example.
Jun
12
revised Just a little absoluteness might be cheaper?
added 44 characters in body
Jun
11
comment Just a little absoluteness might be cheaper?
Thanks, Andres!
Jun
11
comment Just a little absoluteness might be cheaper?
Is the paper by you and Sy the one on BPFA? If so, could you email it to me? I can't find a copy online (JSTOR says it's not archived for some reason).
Jun
11
asked Just a little absoluteness might be cheaper?
Jun
6
comment Existence of polynomials of degree $\geq 2$ which represent infinitely many prime numbers
Related: en.wikipedia.org/wiki/Bunyakovsky_conjecture
May
28
comment Introducing meets while preserving directed closure
Ah, quite right - that's clear in retrospect, I'm tired today.
May
28
comment Introducing meets while preserving directed closure
Can you explain how the Boolean closure messes up $\lambda$-directed closedness? I'm not seeing it . . .
May
26
revised Can the epsilon induction condition be presented with successor case and limit case, similar to transfinite induction?
deleted 140 characters in body
May
26
comment Can the epsilon induction condition be presented with successor case and limit case, similar to transfinite induction?
I've deleted some now-irrelevant comments.
May
25
answered Can the epsilon induction condition be presented with successor case and limit case, similar to transfinite induction?