Switch to: References

Citations of:

Unique solutions

Mathematical Logic Quarterly 52 (6):534-539 (2006)

Add citations

You must login to add citations.
  1. Corrigendum to “Unique Solutions”.Peter Schuster - 2007 - Mathematical Logic Quarterly 53 (2):214-214.
  • Effective Choice and Boundedness Principles in Computable Analysis.Vasco Brattka & Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (1):73-117.
    In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this purpose theorems are considered via their realizers which are operations with certain input and output data. The technical tool to express continuous or computable relations between such operations is Weihrauch reducibility and the partially ordered degree structure induced by it. We have identified certain choice (...)
    Direct download (11 more)  
    Export citation  
    Bookmark   18 citations  
  • Toward a Clarity of the Extreme Value Theorem.Karin U. Katz, Mikhail G. Katz & Taras Kudryk - 2014 - Logica Universalis 8 (2):193-214.
    We apply a framework developed by C. S. Peirce to analyze the concept of clarity, so as to examine a pair of rival mathematical approaches to a typical result in analysis. Namely, we compare an intuitionist and an infinitesimal approaches to the extreme value theorem. We argue that a given pre-mathematical phenomenon may have several aspects that are not necessarily captured by a single formalisation, pointing to a complementarity rather than a rivalry of the approaches.
    Direct download (6 more)  
    Export citation  
    Bookmark   2 citations  
  • Weihrauch Degrees, Omniscience Principles and Weak Computability.Vasco Brattka & Guido Gherardi - 2011 - Journal of Symbolic Logic 76 (1):143 - 176.
    In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension for multi-valued functions on represented spaces. We call the corresponding equivalence classes Weihrauch degrees and we show that the corresponding partial order induces a lower semi-lattice. It turns out that parallelization is a closure operator for this semi-lattice and that the parallelized Weihrauch degrees even form a lattice into which the Medvedev lattice and the Turing degrees can be embedded. The (...)
    Direct download (7 more)  
    Export citation  
    Bookmark   15 citations  
  • Computability of Finite-Dimensional Linear Subspaces and Best Approximation.Vasco Brattka & Ruth Dillhage - 2010 - Annals of Pure and Applied Logic 162 (3):182-193.
    We discuss computability properties of the set of elements of best approximation of some point xX by elements of GX in computable Banach spaces X. It turns out that for a general closed set G, given by its distance function, we can only obtain negative information about as a closed set. In the case that G is finite-dimensional, one can compute negative information on as a compact set. This implies that one can compute the point in whenever it is uniquely (...)
    Direct download (4 more)  
    Export citation  
  • Sequences of Real Functions on [0, 1] in Constructive Reverse Mathematics.Hannes Diener & Iris Loeb - 2009 - Annals of Pure and Applied Logic 157 (1):50-61.
    We give an overview of the role of equicontinuity of sequences of real-valued functions on [0,1] and related notions in classical mathematics, intuitionistic mathematics, Bishop’s constructive mathematics, and Russian recursive mathematics. We then study the logical strength of theorems concerning these notions within the programme of Constructive Reverse Mathematics. It appears that many of these theorems, like a version of Ascoli’s Lemma, are equivalent to fan-theoretic principles.
    Direct download (4 more)  
    Export citation  
    Bookmark   13 citations