default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew Hendtlass
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j14]Hannes Diener, Matthew Hendtlass:
The Third Trick. Log. Methods Comput. Sci. 18(3) (2022)- 2020
- [j13]Hannes Diener, Matthew Hendtlass:
Differentiating convex functions constructively. J. Log. Anal. 12 (2020)
2010 – 2019
- 2019
- [i3]Hannes Diener, Matthew Hendtlass:
(Seemingly) Impossible Theorems in Constructive Mathematics. CoRR abs/1904.11378 (2019) - 2018
- [j12]Hannes Diener, Matthew Hendtlass:
Bishop's Lemma. Math. Log. Q. 64(1-2): 49-54 (2018) - [j11]Vasco Brattka
, Matthew Hendtlass, Alexander P. Kreuzer:
On the Uniform Computational Content of the Baire Category Theorem. Notre Dame J. Formal Log. 59(4): 605-636 (2018) - 2017
- [j10]Vasco Brattka, Matthew Hendtlass, Alexander P. Kreuzer:
On the Uniform Computational Content of Computability Theory. Theory Comput. Syst. 61(4): 1376-1426 (2017) - 2016
- [j9]Emanuele Frittaion, Matthew Hendtlass, Alberto Marcone, Paul Shafer, Jeroen Van der Meeren:
Reverse mathematics, well-quasi-orders, and Noetherian spaces. Arch. Math. Log. 55(3-4): 431-459 (2016) - [j8]Douglas S. Bridges, Matthew Hendtlass, Erik Palmgren:
A constructive examination of rectifiability. J. Log. Anal. 8 (2016) - [j7]Matthew Hendtlass, Robert S. Lubarsky:
Separating Fragments of Wlem, LPO, and MP. J. Symb. Log. 81(4): 1315-1343 (2016) - 2015
- [i2]Vasco Brattka, Matthew Hendtlass, Alexander P. Kreuzer:
On the Uniform Computational Content of Computability Theory. CoRR abs/1501.00433 (2015) - [i1]Vasco Brattka, Matthew Hendtlass, Alexander P. Kreuzer:
On the Uniform Computational Content of the Baire Category Theorem. CoRR abs/1510.01913 (2015) - 2012
- [j6]Matthew Hendtlass:
The intermediate value theorem in constructive mathematics without choice. Ann. Pure Appl. Log. 163(8): 1050-1056 (2012) - [j5]Matthew Hendtlass:
Fixed point theorems in constructive mathematics. J. Log. Anal. 4 (2012) - [c1]Matthew Hendtlass, Peter Schuster:
A Direct Proof of Wiener's Theorem. CiE 2012: 293-302 - 2011
- [j4]Matthew Hendtlass:
The computational content of Walras' existence theorem. Appl. Math. Comput. 217(13): 6185-6191 (2011) - [j3]Matthew Hendtlass, Peter Schuster:
Minima and best approximations in constructive analysis. J. Log. Anal. 3 (2011) - 2010
- [j2]Douglas S. Bridges, Matthew Hendtlass:
Continuous isomorphisms from R onto a complete abelian group. J. Symb. Log. 75(3): 930-944 (2010) - [j1]Douglas S. Bridges, Matthew Hendtlass:
Continuous homomorphisms of R onto a compact group. Math. Log. Q. 56(2): 191-197 (2010)
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-25 05:53 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:
