VLDB 2026 Research / reviewers in the wild / expert
Hannes Diener
dblp:88/5400
· DBLP profile ↗
8ranked-venue papers
6as first author
1since 2021 · last 2022
0000-0002-1122-5753ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 8 · 6 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | The Third Trick
Hannes Diener, Matthew Hendtlass |
Log. Methods Comput. Sci. | 1 |
| 2020 | Notions of Cauchyness and metastabilityabstractAbstract We show that several weakenings of the Cauchy condition are all equivalent under the assumption of countable choice, and investigate to what extent choice is necessary. We also show that the syntactically reminiscent notion of metastability allows similar variations, but is empty in terms of its constructive content.1 Hannes Diener, Robert S. Lubarsky |
J. Log. Comput. | 1 |
| 2015 | Variations on a theme by IshiharaabstractIshihara's tricks have proven to be a highly useful tool in constructive mathematics, since they enable one to make decisions that seem, on first glance, impossible. They do, however, require that one deals with strongly extensional mappings on complete spaces. In this short note, we show how these assumptions can be weakened. Furthermore, we apply these generalizations to give a partial answer to the question, whether constructively we can rule out the existence of injections from Baire space into the natural numbers, to a version of Riemann's per mutation theorem and to a classification problem about cardinalities in constructive reverse mathematics. Hannes Diener |
Math. Struct. Comput. Sci. | 1 |
| 2014 | Separating the Fan Theorem and its weakeningsabstractAbstract Varieties of the Fan Theorem have recently been developed in reverse constructive mathematics, corresponding to different continuity principles. They form a natural implicational hierarchy. Some of the implications have been shown to be strict, others strict in a weak context, and yet others not at all, using disparate techniques. Here we present a family of related Kripke models which separates all of the as yet identified fan theorems. Robert S. Lubarsky, Hannes Diener |
J. Symb. Log. | 2 |
| 2013 | Principles weaker than BD-NabstractAbstract BD-N is a weak principle of constructive analysis. Several interesting principles implied by BD-N have already been identified, namely the closure of the anti-Specker spaces under product, the Riemann Permutation Theorem, and the Cauchyness of all partially Cauchy sequences. Here these are shown to be strictly weaker than BD-N, yet not provable in set theory alone under constructive logic. Hannes Diener, Robert S. Lubarsky |
J. Symb. Log. | 1 |
| 2009 | Uniqueness, Continuity, and Existence of Implicit Functions in Constructive Analysis
Hannes Diener, Peter Schuster 0001 |
CCA | 1 |
| 2009 | Sequences of real functions on [0, 1] in constructive reverse mathematics
Hannes Diener, Iris Loeb |
Ann. Pure Appl. Log. | 1 |
| 2007 | The pseudocompactness of [0, 1] is equivalent to the uniform continuity theoremabstractAbstract We prove constructively that, in order to derive the uniform continuity theorem for pointwise continuous mappings from a compact metric space into a metric space, it is necessary and sufficient to prove any of a number of equivalent conditions, such as that every pointwise continuous mapping of [0, 1] into ℝ is bounded. The proofs are analytic, making no use of, for example, fan-theoretic ideas. Douglas S. Bridges, Hannes Diener |
J. Symb. Log. | 2 |