default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHannes Diener
Person information
- affiliation: University of Siegen, Germany
- affiliation: University of Canterbury, NZ
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j19]Hannes Diener, Matthew Hendtlass:
The Third Trick. Log. Methods Comput. Sci. 18(3) (2022)- 2020
- [j18]Hannes Diener, Maarten McKubre-Jordens
:
Classifying material implications over minimal logic. Arch. Math. Log. 59(7-8): 905-924 (2020) - [j17]Hannes Diener, Matthew Hendtlass:
Differentiating convex functions constructively. J. Log. Anal. 12 (2020) - [j16]Hannes Diener, Robert S. Lubarsky:
Notions of Cauchyness and metastability. J. Log. Comput. 30(8): 1487-1504 (2020)
2010 – 2019
- 2019
- [i2]Hannes Diener, Matthew Hendtlass:
(Seemingly) Impossible Theorems in Constructive Mathematics. CoRR abs/1904.11378 (2019) - 2018
- [j15]Hannes Diener, Matthew Hendtlass:
Bishop's Lemma. Math. Log. Q. 64(1-2): 49-54 (2018) - [c3]Hannes Diener, Robert S. Lubarsky:
Notions of Cauchyness and Metastability. LFCS 2018: 140-153 - [i1]Louis Warren, Hannes Diener, Maarten McKubre-Jordens:
The Drinker Paradox and its Dual. CoRR abs/1805.06216 (2018) - 2015
- [j14]Hannes Diener:
Variations on a theme by Ishihara. Math. Struct. Comput. Sci. 25(7): 1569-1577 (2015) - 2014
- [j13]Robert S. Lubarsky, Hannes Diener:
Separating the Fan Theorem and its weakenings. J. Symb. Log. 79(3): 792-813 (2014) - [e1]Vasco Brattka, Hannes Diener, Dieter Spreen:
Logic, Computation, Hierarchies. Ontos Mathematical Logic 4, De Gruyter 2014, ISBN 978-1-61451-804-4 [contents] - 2013
- [j12]Hannes Diener:
Weak König's Lemma Implies the Uniform Continuity Theorem. Comput. 2(1): 9-13 (2013) - [j11]Hannes Diener, Robert S. Lubarsky:
Principles weaker than BD-N. J. Symb. Log. 78(3): 873-885 (2013) - [c2]Robert S. Lubarsky, Hannes Diener:
Separating the Fan Theorem and Its Weakenings. LFCS 2013: 280-295 - 2012
- [j10]Hannes Diener:
Reclassifying the antithesis of Specker's theorem. Arch. Math. Log. 51(7-8): 687-693 (2012) - [j9]Hannes Diener, Anton Hedin:
The Vitali covering theorem in constructive mathematics. J. Log. Anal. 4 (2012) - 2011
- [j8]Hannes Diener, Iris Loeb:
Constructive reverse investigations into differential equations. J. Log. Anal. 3 (2011) - [j7]Hannes Diener, Peter Schuster:
Uniqueness, continuity and the existence of implicit functions in constructive analysis. LMS J. Comput. Math. 14: 127-136 (2011) - 2010
- [j6]Hannes Diener, Peter Schuster:
On Choice Principles and Fan Theorems. J. Univers. Comput. Sci. 16(18): 2556-2562 (2010) - [j5]Douglas S. Bridges, Hannes Diener:
The anti-Specker property, positivity, and total boundedness. Math. Log. Q. 56(4): 434-441 (2010)
2000 – 2009
- 2009
- [j4]Hannes Diener, Iris Loeb:
Sequences of real functions on [0, 1] in constructive reverse mathematics. Ann. Pure Appl. Log. 157(1): 50-61 (2009) - [c1]Hannes Diener, Peter Schuster:
Uniqueness, Continuity, and Existence of Implicit Functions in Constructive Analysis. CCA 2009 - 2008
- [j3]Hannes Diener:
Generalising compactness. Math. Log. Q. 54(1): 49-57 (2008) - 2007
- [j2]Douglas S. Bridges, Hannes Diener:
The pseudocompactness of [0, 1] is equivalent to the uniform continuity theorem. J. Symb. Log. 72(4): 1379-1384 (2007) - 2006
- [j1]Douglas S. Bridges, Hannes Diener:
A constructive treatment of Urysohn's Lemma in an apartness space. Math. Log. Q. 52(5): 464-469 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
