Matthew Hendtlass

dblp:30/8760 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 6 · 3 first-author · 1 since 2021
YearPublicationVenuePosition
2022 The Third Trick
Hannes Diener, Matthew Hendtlass
Log. Methods Comput. Sci.2
2017 On the Uniform Computational Content of Computability Theory
Vasco Brattka, Matthew Hendtlass, Alexander P. Kreuzer
Theory Comput. Syst.2
2016 Separating Fragments of Wlem, LPO, and MP
abstract
Abstract We separate many of the basic fragments of classical logic which are used in reverse constructive mathematics. A group of related Kripke and topological models is used to show that various fragments of the Weak Law of the Excluded Middle, the Limited Principle of Omniscience, and Markov’s Principle, including Weak Markov’s Principle, do not imply each other.
Matthew Hendtlass, Robert S. Lubarsky
J. Symb. Log.1
2012 A Direct Proof of Wiener's Theorem
Matthew Hendtlass, Peter Schuster 0001
CiE1
2012 The intermediate value theorem in constructive mathematics without choice
Matthew Hendtlass
Ann. Pure Appl. Log.1
2010 Continuous isomorphisms from R onto a complete abelian group
abstract
Abstract This paper provides a Bishop-style constructive analysis of the contrapositive of the statement that a continuous homomorphism ofRonto a compact abelian group is periodic. It is shown that, subject to a weak locatedness hypothesis, ifGis a complete (metric) abelian group that is the range of a continuous isomorphism fromR, thenGis noncompact. A special case occurs whenGsatisfies a certain local path-connectedness condition at 0. A number of results about one-one and injective mappings are proved en route to the main theorem. A Brouwerian example shows that some of our results are the best possible in a constructive framework.
Douglas S. Bridges, Matthew Hendtlass
J. Symb. Log.2