Philipp Gerhardy

According to our database1, Philipp Gerhardy authored at least 8 papers between 2003 and 2010.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2010
The Ordinal of Skolem + Tetration Is <i>tau</i><sub>0</sub>.
Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2009
Skolem + Tetration Is Well-Ordered.
Proceedings of the Mathematical Theory and Computational Practice, 2009

2008
Proof Mining in Topological Dynamics.
Notre Dame J. Formal Log., 2008

2006
Strongly uniform bounds from semi-constructive proofs.
Ann. Pure Appl. Log., 2006

2005
The Role of Quantifier Alternations in Cut Elimination.
Notre Dame J. Formal Log., 2005

Extracting Herbrand disjunctions by functional interpretation.
Arch. Math. Log., 2005

Generalized metatheorems on the extractability of uniform bounds in functional analysis.
Proceedings of the Mathematics, Algorithms, Proofs, 9.-14. January 2005, 2005

2003
Refined Complexity Analysis of Cut Elimination.
Proceedings of the Computer Science Logic, 17th International Workshop, 2003


  Loading...