Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I

DOI10.1016/S0168-0072(97)00058-4zbMath0946.03052MaRDI QIDQ1295392

Lawrence Welch, Iraj Kalantari

Publication date: 15 September 1999

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

continuityrecursive analysiscomputabilitycomputable analysispoint-free topologycomputable topologyrecursive realsrecursive topologyrecursive points

Mathematics Subject Classification ID

Convergence in general topology (sequences, filters, limits, convergence spaces, nets, etc.) (54A20) Applications of computability and recursion theory (03D80) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (10)

Effectiveness in RPL, with applications to continuous logic ⋮ A blend of methods of recursion theory and topology. ⋮ On Turing degrees of points in computable topology ⋮ On degree-preserving homeomorphisms between trees in computable topology ⋮ When series of computable functions with varying domains are computable ⋮ Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis ⋮ Effective versions of local connectivity properties ⋮ Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II ⋮ On the Computable Theory of Bounded Analytic Functions ⋮ Computable Complex Analysis

Cites Work

• Intuitionism. An introduction
• Differential equations in constructive analysis and in the recursive realizability topos
• Effective topological spaces. I: A definability theory
• Effective topological spaces. II: A hierarchy
• Effective topological spaces. III: Forcing and definability
• Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II
• Principles of intuitionism. Lectures presented at the summer conference on intuitionism and proof theory (1968) at SUNY at Buffalo, NY
• Recursive analysis
• Computable functionals
• On computable sequences
• Maximality in effective topology
• Degrees of recursively enumerable topological spaces
• Simplicity in effective topology
• Recursive constructions in topological spaces
• Analysis without actual infinity
• The point of pointless topology
• On the Definition of Computable Function of a Real Variable
• Recursively enumerable Boolean algebras
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
• Recursion Theory and Dedekind Cuts
• Recursive real numbers
• Recursive metric spaces
• What is a Real Number?
• On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
• Criteria of constructibility for real numbers
• Recursive Real Numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I