Continuous isomorphisms from R onto a complete abelian group. - Douglas S. Bridges; Matthew Hendtlass (J. Symb. Log., 2010)

Continuous homomorphisms of R onto a compact group. - Douglas S. Bridges; Matthew Hendtlass (Math. Log. Q., 2010)

The computational content of Walras' existence theorem. - Matthew Hendtlass (Appl. Math. Comput., 2011)

Minima and best approximations in constructive analysis. - Matthew Hendtlass; Peter Schuster 001 (J. Log. Anal., 2011)

A Direct Proof of Wiener's Theorem. - Matthew Hendtlass; Peter Schuster 001 (CiE, 2012)

The intermediate value theorem in constructive mathematics without choice. - Matthew Hendtlass (Ann. Pure Appl. Log., 2012)

Fixed point theorems in constructive mathematics. - Matthew Hendtlass (J. Log. Anal., 2012)

Reverse mathematics, well-quasi-orders, and Noetherian spaces. - Emanuele Frittaion; Matthew Hendtlass; Alberto Marcone; Paul Shafer; Jeroen Van der Meeren (Arch. Math. Log., 2016)

A constructive examination of rectifiability. - Douglas S. Bridges; Matthew Hendtlass; Erik Palmgren (J. Log. Anal., 2016)

Separating Fragments of Wlem, LPO, and MP. - Matthew Hendtlass; Robert S. Lubarsky (J. Symb. Log., 2016)

On the Uniform Computational Content of Computability Theory. - Vasco Brattka; Matthew Hendtlass; Alexander P. Kreuzer (Theory Comput. Syst., 2017)

Bishop's Lemma. - Hannes Diener; Matthew Hendtlass (Math. Log. Q., 2018)

On the Uniform Computational Content of the Baire Category Theorem. - Vasco Brattka; Matthew Hendtlass; Alexander P. Kreuzer (Notre Dame J. Formal Log., 2018)

(Seemingly) Impossible Theorems in Constructive Mathematics. - Hannes Diener; Matthew Hendtlass (CoRR, 2019)

Differentiating convex functions constructively. - Hannes Diener; Matthew Hendtlass (J. Log. Anal., 2020)

The Third Trick. - Hannes Diener; Matthew Hendtlass (Log. Methods Comput. Sci., 2022)