8 found
Order:
Disambiguations
Matthew Hendtlass [7]Matt Hendtlass [1]
  1.  29
    On the Uniform Computational Content of the Baire Category Theorem.Vasco Brattka, Matthew Hendtlass & Alexander P. Kreuzer - 2018 - Notre Dame Journal of Formal Logic 59 (4):605-636.
    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 principle that states that a complete metric space cannot be decomposed into countably many nowhere dense pieces. The Baire category theorem is an illuminating example of a theorem that can be used to demonstrate that one classical theorem can have several different computational interpretations. For one, we distinguish two different logical versions of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  2.  41
    Reverse mathematics, well-quasi-orders, and Noetherian spaces.Emanuele Frittaion, Matthew Hendtlass, Alberto Marcone, Paul Shafer & Jeroen Van der Meeren - 2016 - Archive for Mathematical Logic 55 (3):431-459.
    A quasi-order Q induces two natural quasi-orders on P(Q){\mathcal{P}(Q)}, but if Q is a well-quasi-order, then these quasi-orders need not necessarily be well-quasi-orders. Nevertheless, Goubault-Larrecq (Proceedings of the 22nd Annual IEEE Symposium 4 on Logic in Computer Science (LICS’07), pp. 453–462, 2007) showed that moving from a well-quasi-order Q to the quasi-orders on P(Q){\mathcal{P}(Q)} preserves well-quasi-orderedness in a topological sense. Specifically, Goubault-Larrecq proved that the upper topologies of the induced quasi-orders on P(Q){\mathcal{P}(Q)} are Noetherian, which means that they contain no (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  3.  26
    Separating fragments of wlem, lpo, and mp.Matt Hendtlass & Robert Lubarsky - 2016 - Journal of Symbolic Logic 81 (4):1315-1343.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4.  21
    Continuous homomorphisms of R onto a compact group.Douglas Bridges & Matthew Hendtlass - 2010 - Mathematical Logic Quarterly 56 (2):191-197.
    It is shown within Bishop's constructive mathematics that, under one extra, classically automatic, hypothesis, a continuous homomorphism from R onto a compact metric abelian group is periodic, but that the existence of the minimum value of the period is not derivable.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5.  23
    Continuous isomorphisms from R onto a complete abelian group.Douglas Bridges & Matthew Hendtlass - 2010 - Journal of Symbolic Logic 75 (3):930-944.
    This paper provides a Bishop-style constructive analysis of the contrapositive of the statement that a continuous homomorphism of R onto a compact abelian group is periodic. It is shown that, subject to a weak locatedness hypothesis, if G is a complete (metric) abelian group that is the range of a continuous isomorphism from R, then G is noncompact. A special case occurs when G satisfies a certain local path-connectedness condition at 0. A number of results about one-one and injective mappings (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  6.  19
    Bishop's Lemma.Hannes Diener & Matthew Hendtlass - 2018 - Mathematical Logic Quarterly 64 (1-2):49-54.
    Bishop's Lemma is a centrepiece in the development of constructive analysis. We show that its proof requires some form of the axiom of choice; and that the completeness requirement in Bishop's Lemma can be weakened and that there is a vast class of non‐complete spaces that Bishop's Lemma applies to.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7.  14
    A direct proof of Wiener's theorem.Matthew Hendtlass & Peter Schuster - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 293--302.
    Direct download  
     
    Export citation  
     
    Bookmark  
  8.  32
    The intermediate value theorem in constructive mathematics without choice.Matthew Hendtlass - 2012 - Annals of Pure and Applied Logic 163 (8):1050-1056.