On Turing degrees of points in computable topology

DOI10.1002/malq.200710062zbMath1148.03031MaRDI QIDQ3528143

Iraj Kalantari, Lawrence Welch

Publication date: 8 October 2008

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.200710062

zbMATH Keywords

computability; computable analysis; Turing degree; computable topology; point-freeness

Mathematics Subject Classification ID

03D80: Applications of computability and recursion theory

03D30: Other degrees and reducibilities in computability and recursion theory

03D45: Theory of numerations, effectively presented structures

03D28: Other Turing degree structures

Related Items

Separating notions in effective topology, COMPUTABLY COMPACT METRIC SPACES, On degree-preserving homeomorphisms between trees in computable topology

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On degree-preserving homeomorphisms between trees in computable topology
• 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.
• On the hierarchy and extension of monotonically computable real numbers.
• On effective topological spaces
• Continuous Lattices and Domains
• Degrees of unsolvability of continuous functions
• On Computable Numbers, with an Application to the Entscheidungsproblem