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

https://doi.org/10.1016/S0168-0072(98)00048-7Get rights and content
Under an Elsevier user license
open archive

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.

MSC

03D45
03D80
03C57
54A20

Keywords

Recursion theory
Computability
Recursive analysis
Computable analysis
Recursive topology
Computable topology
Point-free topology
Continuity

Cited by (0)