A blend of methods of recursion theory and topology.

DOI10.1016/S0168-0072(03)00054-XzbMath1041.03033MaRDI QIDQ1412834

Iraj Kalantari, Lawrence Welch

Publication date: 25 November 2003

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

zbMATH Keywords

topologyrecursive analysisrecursion theorycomputable analysisrecursive topology

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Related Items (7)

Closed choice and a uniform low basis theorem ⋮ 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 ⋮ A blend of methods of recursion theory and topology: a \(\Pi_1^0\) tree of shadow points ⋮ DEMUTH’S PATH TO RANDOMNESS

Cites Work

• Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I
• Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II
• A blend of methods of recursion theory and topology: a \(\Pi_1^0\) tree of shadow points
• Recursive analysis
• Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
• Some properties of constructive real numbers and constructive functions
• On singular coverings and properties of constructive functions connected with them
• ∏ 0 1 Classes and Degrees of Theories
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A blend of methods of recursion theory and topology.