MathOverflow will be down for maintenance for approximately 3 hours, starting Monday evening (06/24/2013) at approximately 9:00 PM Eastern time (UTC-4).

Noah S

4,240
Reputation
1670 views
Is this your account?

Registered User 

Name Noah S
Member for 2 years
Seen 7 hours ago
Website
Location
Age
I'm a graduate student at UC Berkeley, studying mathematical logic. I'm especially interested in reverse mathematics and abstract model theory.
38

Questions
votes newest views recent
6

7

11

4

3

3

3
12
votes
4
answers
1k
views

Fermat’s Last Theorem and Computability Theory

dec 23 10 at 21:51 Pete L. Clark 40k●4●103●227

4
12
votes
1
answer
432
views

2-colorings of the reals

dec 16 11 at 1:17 Amit Kumar Gupta 2,909●11●26

 

3
10
votes
3
answers
722
views

When can we detect forcing?

nov 15 10 at 0:09 Andres Caicedo 14.8k●1●43●81

1 2 3 4 next

 

48

Answers
votes newest views recent
14
Similarities between Post’s Problem and Cohen’s Forcing
13
Is there any proof that you feel you do not “understand”?
11
Road to Solovay’s Land.
10
How are Modal Logic and Graph Theory related?
10
A Model where Dedekind Reals and Cauchy Reals are Different
10
Computability complexity of the first-order theory of arithmetic?
8
Is it possible to construct an infinite subset of $\Bbb R$ that is not order isomorphic to any proper subset of itself?
8
Notation arb(x)
7
A question about Universal sets.
7
Self-containing structures
6
The set of $\Delta_1$ indices
6
Are the two meanings of “undecidable” related?
6
Question on Godel completeness theorem
6
Ontological status of some “sets” in ZFC
5
Undecidable completion of undecidable theory, and pairs of RCF
4
Moschovakis Coding Lemma
4
A question about Second-Order ZFC and the Continuum Hypothesis
4
Examples of conjectures that were widely believed to be true but later proved false
4
ULTRAINFINITISM, or a step beyond the transfinite
4
Elementary submodels of V
4
Games that never begin
4
A (seem to be) elementary logic question
4
Set theory question
4
Is deciding whether a Turing machine *provably* runs forever equivalent to the halting problem?
4
Avoiding reflexive paradox in set theory
3
The paradox with the first uncountable ordinal
3
Forcing over models without the axiom of choice
2
$(<\kappa)$-closure for Prikry forcing
2
Cardinality of a certain set of distinct subsets of $\mathbb{N}$
2
Composite pairs of the form n!-1 and n!+1
1 2 next

 

60

Votes
52
8

 

61

Tags
× 57
× 35
× 16
× 14
× 13
× 8
× 8
× 7
× 7
× 6
 × 4
× 4
× 4
× 3
× 3
× 2
× 2
× 2
× 2
× 2
 × 2
× 2
× 2



















 

36

Badges
● Nice Answer× 6
● Popular Question× 3
● Nice Question× 12
● Notable Question
 ● Self-Learner
● Enlightened× 2
● Yearling× 2
● Citizen Patrol
 ● Critic
● Supporter
● Commentator
● Editor
 ● Enthusiast
● Scholar
● Student
● Teacher