Pages that link to "Item:Q926175"
From MaRDI portal
The following pages link to Borel complexity and computability of the Hahn-Banach theorem (Q926175):
Displaying 14 items.
- The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma (Q408156) (← links)
- Computability of finite-dimensional linear subspaces and best approximation (Q638485) (← links)
- A computable version of Banach's inverse mapping theorem (Q1006604) (← links)
- Problems, solutions, and completions (Q1044674) (← links)
- The uniform content of partial and linear orders (Q2400498) (← links)
- Ramsey’s theorem for singletons and strong computable reducibility (Q2951171) (← links)
- Effective Choice and Boundedness Principles in Computable Analysis (Q3083466) (← links)
- Computability and Analysis, a Historical Approach (Q3188239) (← links)
- Computability of the Metric Projection Onto Finite-dimensional Linear Subspaces (Q4918004) (← links)
- How Incomputable is the Separable Hahn-Banach Theorem? (Q4918007) (← links)
- Weihrauch Complexity in Computable Analysis (Q5024577) (← links)
- (Q5718580) (← links)
- COMPUTABLY COMPACT METRIC SPACES (Q6170503) (← links)
- Computably and punctually universal spaces (Q6614035) (← links)