13 citations · 29 across the 11 of their papers we have counts for
11 papers
(Seemingly) Impossible Theorems in Constructive Mathematics
Hannes Diener, Matthew Hendtlass
We prove some constructive results that on first and maybe even on second glance seem impossible.
Rectifiability and finite variation
Matthew Hendtlass
We show that the length of a path in can be computed if and only if its variation in every direction can.
The Third Trick
Hannes Diener, Matthew Hendtlass
We prove a result, similar to the ones known as Ishihara's First and Second Trick, for sequences of functions.
Equivalents of disjunctive Markov's principle
Matthew Hendtlass
The purpose of this short note is to point out a rich source of natural equivalents of the weak semi-intuitionistic principle MP in reverse constructive mathematics: many si…
Constructing the demand function of a strictly convex preference relation
Matthew Hendtlass
We give conditions under which the demand function of a strictly convex preference relation can be constructed.
On the construction of general equilibria in a competitive economy
Matthew Hendtlass, Nazar Miheisi
This paper gives a constructive treatment of McKenzie's theorem on the existence of general equilibria. While the full theorem does not admit a constructive proof, and hence does n…
Kakutani's fixed point theorem in constructive mathematics
Matthew Hendtlass
In this paper we consider Kakutani's extension of the Brouwer fixed point theorem within the framework of Bishop's constructive mathematics. Kakutani's fixed point theorem is class…
Weak König's lemma implies the uniform continuity theorem: a direct proof
Matthew Hendtlass
We show in Bishop's constructive mathematics---in particular, using countable choice---that weak König's lemma implies the uniform continuity theorem.
On the Uniform Computational Content of the Baire Category Theorem
Vasco Brattka, Matthew Hendtlass, Alexander P. Kreuzer
We study the uniform computational content of different versions of the Baire Category Theorem in the Weihrauch lattice. The Baire Category Theorem can be seen as a pigeonhole prin…
Reverse mathematics, well-quasi-orders, and Noetherian spaces
Emanuele Frittaion, Matt Hendtlass, Alberto Marcone +2
A quasi-order induces two natural quasi-orders on , but if is a well-quasi-order, then these quasi-orders need not necessarily be well-quasi-orders. Nevertheless, Gou…
On the Uniform Computational Content of Computability Theory
Vasco Brattka, Matthew Hendtlass, Alexander P. Kreuzer
We demonstrate that the Weihrauch lattice can be used to classify the uniform computational content of computability-theoretic properties as well as the computational content of th…