• Title of article

    Recursive and nonextendible functions over the reals; filter foundation for recursive analysis.II Original Research Article

  • Author/Authors

    Iraj Kalantari، نويسنده , , Lawrence Welch، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 1999
  • Pages
    24
  • From page
    87
  • To page
    110
  • Abstract
    In this paper we continue our work of Kalantari and Welch (1998). There we introduced machinery to produce a point-free approach to points and functions on topological spaces and found conditions for both which lend themselves to effectivization. While we studied recursive points in that paper, here, we present two useful classes of recursive functions on topological spaces, apply them to the reals, and find precise accounting for the nature of the properties of some examples that exist in the literature. We end with a construction of a recursive function on a small subset of the unit interval which is strongly nonextendible.
  • Keywords
    Computable analysis , Computability , Point-free topology , Computable topology , Recursive topology , Recursion theory , continuity , Recursive analysis
  • Journal title
    Annals of Pure and Applied Logic
  • Serial Year
    1999
  • Journal title
    Annals of Pure and Applied Logic
  • Record number

    896193