Parallelizations in Weihrauch reducibility and constructive reverse mathematics
From MaRDI portal
Publication:2106590
DOI10.1007/978-3-030-51466-2_4OpenAlexW3037838143MaRDI QIDQ2106590
Publication date: 16 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-51466-2_4
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reverse mathematics and uniformity in proofs without excluded middle
- Constructivism in mathematics. An introduction. Volume II
- The binary expansion and the intermediate value theorem in constructive reverse mathematics
- Using Ramsey's theorem once
- Bar induction and restricted classical logic
- Finite choice, convex choice and sorting
- On uniform relationships between combinatorial problems
- Weihrauch degrees, omniscience principles and weak computability
- Effective Choice and Boundedness Principles in Computable Analysis
- On the algebraic structure of Weihrauch degrees
- ON WEIHRAUCH REDUCIBILITY AND INTUITIONISTIC REVERSE MATHEMATICS
- Weihrauch and constructive reducibility between existence statements
- Connected choice and the Brouwer fixed point theorem
- The Weak Kőnig Lemma, Brouwer’s Fan Theorem, De Morgan’s Law, and Dependent Choice
- Representations of Reals in Reverse Mathematics
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
This page was built for publication: Parallelizations in Weihrauch reducibility and constructive reverse mathematics
