On degree-preserving homeomorphisms between trees in computable topology

DOI10.1007/S00153-007-0056-0zbMath1140.03027OpenAlexW2009022101MaRDI QIDQ926174

Iraj Kalantari, Lawrence Welch

Publication date: 26 May 2008

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

Full work available at URL: https://doi.org/10.1007/s00153-007-0056-0

zbMATH Keywords

TopologyRecursion theoryAvoidable pointsComputability theoryComputable analysisComputable topologyRecursive analysisRecursive topologyShadow 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 (1)

On Turing degrees of points in computable topology

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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 blend of methods of recursion theory and topology: a \(\Pi_1^0\) tree of shadow points
• On Turing degrees of points in computable topology
• Π₀¹-classes and Rado's selection principle
• ∏ 0 1 Classes and Degrees of Theories

This page was built for publication: On degree-preserving homeomorphisms between trees in computable topology