Switch to: Citations

Add references

You must login to add references.
  1. Effective Borel measurability and reducibility of functions.Vasco Brattka - 2005 - Mathematical Logic Quarterly 51 (1):19-44.
    The investigation of computational properties of discontinuous functions is an important concern in computable analysis. One method to deal with this subject is to consider effective variants of Borel measurable functions. We introduce such a notion of Borel computability for single-valued as well as for multi-valued functions by a direct effectivization of the classical definition. On Baire space the finite levels of the resulting hierarchy of functions can be characterized using a notion of reducibility for functions and corresponding complete functions. (...)
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • Computable operators on regular sets.Martin Ziegler - 2004 - Mathematical Logic Quarterly 50 (4-5):392-404.
    For regular sets in Euclidean space, previous work has identified twelve ‘basic’ computability notions to which many previous notions considered in literature were shown to be equivalent. With respect to those basic notions we now investigate on the computability of natural operations on regular sets: union, intersection, complement, convex hull, image, and pre-image under suitable classes of functions. It turns out that only few of these notions are suitable in the sense of rendering all those operations uniformly computable.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • The Arithmetical Hierarchy of Real Numbers.Xizhong Zheng & Klaus Weihrauch - 2001 - Mathematical Logic Quarterly 47 (1):51-66.
    A real number x is computable iff it is the limit of an effectively converging computable sequence of rational numbers, and x is left computable iff it is the supremum of a computable sequence of rational numbers. By applying the operations “sup” and “inf” alternately n times to computable sequences of rational numbers we introduce a non-collapsing hierarchy {Σn, Πn, Δn : n ∈ ℕ} of real numbers. We characterize the classes Σ2, Π2 and Δ2 in various ways and give (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Ensembles Récursivement Mesurable et Ensembles Récursivement Ouverts ou Fermés.Georg Kreisel & Daniel Lacombe - 1966 - Journal of Symbolic Logic 31 (1):133-133.
    Download  
     
    Export citation  
     
    Bookmark   5 citations