Parallelizations in Weihrauch reducibility and constructive reverse mathematics
From MaRDI portal
Publication:2106590
DOI10.1007/978-3-030-51466-2_4OpenAlexW3037838143MaRDI QIDQ2106590FDOQ2106590
Authors: Makoto Fujiwara 
Publication date: 16 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-51466-2_4
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
- Title not available (Why is that?)
- Representations of Reals in Reverse Mathematics
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- Constructivism in mathematics. An introduction. Volume II
- Title not available (Why is that?)
- Weihrauch degrees, omniscience principles and weak computability
- Title not available (Why is that?)
- Effective Choice and Boundedness Principles in Computable Analysis
- On uniform relationships between combinatorial problems
- Reverse mathematics and uniformity in proofs without excluded middle
- The weak König lemma, Brouwer's fan theorem, De Morgan's law, and dependent choice
- On the algebraic structure of Weihrauch degrees
- The binary expansion and the intermediate value theorem in constructive reverse mathematics
- Connected choice and the Brouwer fixed point theorem
- Bar induction and restricted classical logic
- Using Ramsey's theorem once
- Finite choice, convex choice and sorting
- On Weihrauch reducibility and intuitionistic reverse mathematics
- Weihrauch and constructive reducibility between existence statements
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)
