Skip to main content
MathOverflow
Dmytro Taranovsky's user avatar
Dmytro Taranovsky's user avatar
Dmytro Taranovsky's user avatar
Dmytro Taranovsky
  • Member for 7 years, 4 months
  • Last seen this week
Profile Activity
Stats
7,555
reputation
102k
reached
41
answers
69
questions
Communities
Badges
View all badges
1
gold badge
22
silver badges
45
bronze badges
Top tags
View all tags
201
Score
92
Posts
84
Posts %
168
Score
76
Posts
69
Posts %
62
Score
34
Posts
31
Posts %
53
Score
20
Posts
18
Posts %
26
Score
17
Posts
15
Posts %
18
Score
16
Posts
15
Posts %
Top posts
View all questions and answers
question
35
Examples of statements with a high quantifier complexity
Sep 24, 2017
answer
21
Do we expect that sufficiently large computable ordinals settle every question of arithmetic?
Oct 15, 2022
answer
18
Is the analysis as taught in universities in fact the analysis of definable numbers?
Aug 30, 2017
question
18
When can we add choice to a model of ZF
Oct 1
answer
17
Is this theory the complete theory of the real ordered field?
Mar 1, 2021
question
17
Minimum transitive models and V=L
Jan 8, 2023
question
16
Consistency strength of $j:L_δ→L_δ$ for some δ
Dec 21, 2018
answer
14
Is there a $\Pi_2$ sentence $A$ such that $\text{ZFC}^- + A$ proves powerset?
Nov 20
answer
12
How much determinacy do you need for second order arithmetic to be as strong as ZFC?
Jul 15, 2023
answer
12
Is Collection really stronger than Replacement?
Jan 4, 2021
Top Meta posts
1
0
10
MathOverflow answers and peer review
Top network posts
View all network posts
23
Fine-grained complexity of BPP
16
An algebra of complexity classes
15
Does $∩_{ε>0} \mathrm{DTIME}(O(n^{2+ε})) = \mathrm{DTIME}(n^{2+o(1)})$?
15
Sorting with an average of $\mathrm{lg}(n!)+o(n)$ comparisons
11
Does $∩_{ε>0} \mathrm{DTIME}(O(n^{2+ε})) = \mathrm{DTIME}(n^{2+o(1)})$?