Hannes Diener

According to our database1, Hannes Diener authored at least 16 papers between 2006 and 2018.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Bishop's Lemma.
Math. Log. Q., 2018

Notions of Cauchyness and Metastability.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2018

2015
Variations on a theme by Ishihara.
Mathematical Structures in Computer Science, 2015

2013
Principles weaker than BD-N.
J. Symb. Log., 2013

Weak König's Lemma Implies the Uniform Continuity Theorem.
Computability, 2013

Separating the Fan Theorem and Its Weakenings.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2013

2012
The Vitali covering theorem in constructive mathematics.
J. Logic & Analysis, 2012

Reclassifying the antithesis of Specker's theorem.
Arch. Math. Log., 2012

2011
Constructive reverse investigations into differential equations.
J. Logic & Analysis, 2011

2010
The anti-Specker property, positivity, and total boundedness.
Math. Log. Q., 2010

On Choice Principles and Fan Theorems.
J. UCS, 2010

2009
Sequences of real functions on [0, 1] in constructive reverse mathematics.
Ann. Pure Appl. Logic, 2009

Uniqueness, Continuity, and Existence of Implicit Functions in Constructive Analysis.
Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, 2009

2008
Generalising compactness.
Math. Log. Q., 2008

2007
The pseudocompactness of [0, 1] is equivalent to the uniform continuity theorem.
J. Symb. Log., 2007

2006
A constructive treatment of Urysohn's Lemma in an apartness space.
Math. Log. Q., 2006


  Loading...