MathOverflow
Dmytro Taranovsky's user avatar
Dmytro Taranovsky's user avatar
Dmytro Taranovsky's user avatar
Dmytro Taranovsky
  • Member for 5 years, 6 months
  • Last seen this week
Profile Activity
Stats
5,437
reputation
78k
reached
31
answers
50
questions
Communities
Badges
View all badges
1
gold badge
15
silver badges
36
bronze badges
Top tags
View all tags
131
Score
67
Posts
83
Posts %
105
Score
52
Posts
64
Posts %
48
Score
28
Posts
35
Posts %
42
Score
18
Posts
22
Posts %
21
Score
8
Posts
10
Posts %
9
Score
19
Posts
23
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
33
Examples of statements with a high quantifier complexity
Sep 24, 2017
answer
20
Do we expect that sufficiently large computable ordinals settle every question of arithmetic?
Oct 15, 2022
answer
17
Is the analysis as taught in universities in fact the analysis of definable numbers?
Aug 30, 2017
question
17
Minimum transitive models and V=L
Jan 8
question
16
Consistency strength of $j:L_δ→L_δ$ for some δ
Dec 21, 2018
answer
15
Is this theory the complete theory of the real ordered field?
Mar 1, 2021
question
12
Infinite descending consistency chains
Jan 11, 2019
question
11
Cut-free proofs in ZFC
Aug 10, 2017
answer
11
Is Collection really stronger than Replacement?
Jan 4, 2021
answer
11
Arguments against large cardinals
Jan 8, 2019
Top network posts
View all network posts
22
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)})$?
14
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)})$?

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.