# Matthew Hendtlass

According to our database

Collaborative distances:

^{1}, Matthew Hendtlass authored at least 13 papers between 2010 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

On the Uniform Computational Content of the Baire Category Theorem.

Notre Dame Journal of Formal Logic, 2018

Bishop's Lemma.

Math. Log. Q., 2018

2017

On the Uniform Computational Content of Computability Theory.

Theory Comput. Syst., 2017

2016

Separating Fragments of Wlem, LPO, and MP.

J. Symb. Log., 2016

A constructive examination of rectifiability.

J. Logic & Analysis, 2016

Reverse mathematics, well-quasi-orders, and Noetherian spaces.

Arch. Math. Log., 2016

2012

Fixed point theorems in constructive mathematics.

J. Logic & Analysis, 2012

The intermediate value theorem in constructive mathematics without choice.

Ann. Pure Appl. Logic, 2012

A Direct Proof of Wiener's Theorem.

Proceedings of the How the World Computes, 2012

2011

Minima and best approximations in constructive analysis.

J. Logic & Analysis, 2011

The computational content of Walras' existence theorem.

Applied Mathematics and Computation, 2011

2010

Continuous homomorphisms of R onto a compact group.

Math. Log. Q., 2010

Continuous isomorphisms from R onto a complete abelian group.

J. Symb. Log., 2010