Parallelizations in Weihrauch reducibility and constructive reverse mathematics
From MaRDI portal
Publication:2106590
Recommendations
- Weihrauch and constructive reducibility between existence statements
- On Weihrauch reducibility and intuitionistic reverse mathematics
- Reverse mathematics and Weihrauch analysis motivated by finite complexity theory
- THE CHARACTERIZATION OF WEIHRAUCH REDUCIBILITY IN SYSTEMS CONTAINING
- Weihrauch degrees, omniscience principles and weak computability
Cites work
- scientific article; zbMATH DE number 3291139 (Why is no real title available?)
- scientific article; zbMATH DE number 2236640 (Why is no real title available?)
- scientific article; zbMATH DE number 2247263 (Why is no real title available?)
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- Bar induction and restricted classical logic
- Connected choice and the Brouwer fixed point theorem
- Constructivism in mathematics. An introduction. Volume II
- Effective Choice and Boundedness Principles in Computable Analysis
- Finite choice, convex choice and sorting
- On Weihrauch reducibility and intuitionistic reverse mathematics
- On the algebraic structure of Weihrauch degrees
- On uniform relationships between combinatorial problems
- Representations of Reals in Reverse Mathematics
- Reverse mathematics and uniformity in proofs without excluded middle
- The binary expansion and the intermediate value theorem in constructive reverse mathematics
- The weak König lemma, Brouwer's fan theorem, De Morgan's law, and dependent choice
- Using Ramsey's theorem once
- Weihrauch and constructive reducibility between existence statements
- Weihrauch degrees, omniscience principles and weak computability
Cited in
(2)
This page was built for publication: Parallelizations in Weihrauch reducibility and constructive reverse mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106590)
