scientific article; zbMATH DE number 7471680
From MaRDI portal
Publication:5028441
Publication date: 9 February 2022
Full work available at URL: https://arxiv.org/abs/2102.11832
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
linear logiccomputability theorycomputable analysisclosure and interior operatorsWeihrauch complexity
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
- Closed choice and a uniform low basis theorem
- Computable invariance
- On the uniform computational content of the Baire category theorem
- On the uniform computational content of computability theory
- Completion of choice
- Joins in the strong Weihrauch degrees
- Probabilistic computability and choice
- Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
- Turing Computability
- Weakly Represented Families in Reverse Mathematics
- Weihrauch degrees, omniscience principles and weak computability
- Effective Choice and Boundedness Principles in Computable Analysis
- Effective Borel measurability and reducibility of functions
- Degrees of Unsolvability: A Tutorial
- On the algebraic structure of Weihrauch degrees
- Dividing by Zero -- How Bad Is It, Really?
- Weihrauch Complexity in Computable Analysis
- Game characterizations and lower cones in the Weihrauch degrees
- Degrees of unsolvability of continuous functions
- The Degrees of Hyperimmune Sets
- WEIHRAUCH GOES BROUWERIAN
This page was built for publication:
