MathOverflow
user avatar
user avatar
user avatar
Damiano Mazza
  • Member for 8 years, 5 months
  • Last seen this week
Profile Activity
Stats
1,296
reputation
35k
reached
13
answers
1
question
Communities
Badges
View all badges
1
gold badge
11
silver badges
11
bronze badges
Top tags
View all tags
68
Score
6
Posts
43
Posts %
33
Score
1
Posts
7
Posts %
25
Score
6
Posts
43
Posts %
19
Score
4
Posts
29
Posts %
19
Score
3
Posts
21
Posts %
17
Score
3
Posts
21
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
33
Time in Girard's Geometry of Interaction
Aug 24, 2014
answer
27
Do you know important theorems that remain unknown?
Apr 3, 2018
answer
13
Is this Wikipedia article linking to the wrong notion of coherent space
Jun 15, 2017
answer
10
Kan extensions in the $2$-category of monoidal categories
May 6, 2015
answer
8
Is there a proof of strong normalisation that uses ordinal numbers?
May 31
answer
7
Recursion theory from the standoint of category theory
Feb 27, 2017
answer
6
Is simply typed lambda calculus with fixed-point combinator Turing-complete?
Feb 13, 2017
answer
6
Is Girard's LU just an embedding of classical and intuitionistic logic into linear logic?
Aug 19, 2017
answer
6
Proof of ¬(¬1 ⊗ ¬1) in tensorial logic
Oct 19, 2018
answer
5
How to handle sums in Tait's reducibility proof of strong normalisation?
Sep 19, 2017
Top network posts
View all network posts
24
How to make the Lambda Calculus strong normalizing without a type system?
22
What is the power of general poly-size permutation branching programs?
22
What is the contribution of lambda calculus to the field of theory of computation?
21
Can typed lambda calculi express *all* algorithms below a given complexity?
17
What if an $\mathsf L$-complete problem has $\mathsf{NC}^1$ circuits? More generally, what evidence is there against $\mathsf{NC}^1=\mathsf{L}$?

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.