Pages that link to "Item:Q3611721"
From MaRDI portal
The following pages link to Borel Complexity of Topological Operations on Computable Metric Spaces (Q3611721):
Displayed 16 items.
- The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma (Q408156) (← links)
- Closed choice and a uniform low basis theorem (Q424541) (← links)
- On the uniform computational content of the Baire category theorem (Q1633900) (← links)
- On the uniform computational content of computability theory (Q1694010) (← links)
- Computable analysis and classification problems (Q2106595) (← links)
- Completion of choice (Q2220486) (← links)
- On images of partial computable functions over computable Polish spaces (Q2403641) (← links)
- $K$-triviality in computable metric spaces (Q2839373) (← links)
- Effective Choice and Boundedness Principles in Computable Analysis (Q3083466) (← links)
- Computable elements and functions in effectively enumerable topological spaces (Q4593240) (← links)
- Computability of Subsets of Metric Spaces (Q5024568) (← links)
- Weihrauch Complexity in Computable Analysis (Q5024577) (← links)
- Effective aspects of Hausdorff and Fourier dimension (Q5061392) (← links)
- Connected choice and the Brouwer fixed point theorem (Q5223123) (← links)
- On the topological aspects of the theory of represented spaces (Q5740207) (← links)
- COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM (Q5858927) (← links)