Switch to: Citations

Add references

You must login to add references.
  1. On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
  • Handbook of Analysis and its Foundations.Eric Schechter - 1997 - Academic Press.
    This self-contained handbook providing broad coverage on the foundations of mathematical analysis, is intended as a study guide for advanced undergraduates and beginning graduate students in mathematics and is a reference for more advanced mathematicians. It provides an introduction to a wide range of topics including set theory and mathematical logic; algebra; toplogy; normed spaces; integration theory; toplogical vector spaces; and differential equations. The author demonstrates the relationships between these topics and includes a few chapters on set theory and logic (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   11 citations  
  • An omniscience principle, the König Lemma and the Hahn‐Banach theorem.Hajime Ishihara - 1990 - Mathematical Logic Quarterly 36 (3):237-240.
  • An omniscience principle, the König Lemma and the Hahn-Banach theorem.Hajime Ishihara - 1990 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 36 (3):237-240.
  • Effective extensions of linear forms on a recursive vector space over a recursive field.R. G. Downey & Iraj Kalantari - 1985 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 31 (13):193-200.
  • Effective Extensions of Linear Forms on a Recursive Vector Space Over a Recursive Fiel.R. Downey & Iraj Kalantari - 1985 - Mathematical Logic Quarterly 31 (13):193-200.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  • 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. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  • Subsystems of Second Order Arithmetic.Stephen George Simpson - 1999 - Springer Verlag.
    Stephen George Simpson. with definition 1.2.3 and the discussion following it. For example, taking 90(n) to be the formula n §E Y, we have an instance of comprehension, VYEIXVn(n€X<—>n¢Y), asserting that for any given set Y there exists a ...
    Direct download  
     
    Export citation  
     
    Bookmark   131 citations  
  • Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.
     
    Export citation  
     
    Bookmark   230 citations