My main research interests are algorithmic aspects of analysis and topology. Even though classical existence results are often reasonably simple to prove, their proofs mostly do not contain any information of how to actually find these objects. The subtleties and intricacies of giving constructive content in analytical and topological theorems is therefore a valuable task, especially if one is interested in the implementation of those results.
- Diener H. and McKubre Jordens M. (2017) Paradoxes of material implication in minimal logic. In Christiansen H; Jiménez-López MD; Loukanova R; Moss LS (Ed.), Partiality and Underspecification in Information, Languages, and KnowledgeCambridge Scholars Publishing.
- Diener H. (2015) Variations on a theme by Ishihara. Mathematical Structures in Computer Science 25(7): 1569-1577. http://dx.doi.org/10.1017/S0960129513000261.
- Brattka V., Diener H. and Spreen D. (Ed.) (2014) Logic, Computation, Hierarchies. Berlin, Boston: De Gruyter. 414pp.
- Lubarsky B. and Diener H. (2014) Principles Weaker than BD-N. Journal of Symbolic Logic 79(3): 792-813. http://dx.doi.org/10.1017/jsl.2014.9.
- Diener H. (2013) Weak Königs Lemma implies the Uniform Continuity Theorem. Computability Volume 2(Number 1) http://dx.doi.org/10.3233/COM-13009.