THE CHARACTERIZATION OF WEIHRAUCH REDUCIBILITY IN SYSTEMS CONTAINING
From MaRDI portal
Publication:5000259
dialectica interpretationhigher-order computability theorylinear logicnonstandard arithmeticphase semanticsWeihrauch reducibility
Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Other degrees and reducibilities in computability and recursion theory (03D30) Higher-type and set recursion theory (03D65) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Recommendations
- On Weihrauch reducibility and intuitionistic reverse mathematics
- Weihrauch and constructive reducibility between existence statements
- Parallelizations in Weihrauch reducibility and constructive reverse mathematics
- Weihrauch degrees, omniscience principles and weak computability
- Weihrauch degrees, omniscience principles and weak computability
Cites work
- A functional interpretation for nonstandard arithmetic
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- Classical consequences of continuous choice principles from intuitionistic analysis
- Computational Interpretations of Classical Linear Logic
- Formal systems for some branches of intuitionistic analysis
- Functional interpretations of intuitionistic linear logic
- Functional Interpretations of Intuitionistic Linear Logic
- scientific article; zbMATH DE number 3163761 (Why is no real title available?)
- scientific article; zbMATH DE number 4104952 (Why is no real title available?)
- scientific article; zbMATH DE number 1062120 (Why is no real title available?)
- scientific article; zbMATH DE number 3216998 (Why is no real title available?)
- scientific article; zbMATH DE number 3316918 (Why is no real title available?)
- Intuitionistic provability versus uniform provability in \(\mathsf{RCA}\)
- Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
- On Weihrauch reducibility and intuitionistic reverse mathematics
- The blind spot. Lectures on logic
- The Dialectica interpretation of first-order classical affine logic
- Using Ramsey's theorem once
- Weihrauch and constructive reducibility between existence statements
- Weihrauch degrees, omniscience principles and weak computability
Cited in
(7)- Parallelizations in Weihrauch reducibility and constructive reverse mathematics
- Using Ramsey's theorem once
- Weihrauch and constructive reducibility between existence statements
- Weihrauch Complexity in Computable Analysis
- Reduction games, provability and compactness
- The characterization of Weihrauch reducibility in systems containing E-PA$^{\omega}$ + QF-AC$^{0,0}$
- Weihrauch problems as containers
This page was built for publication: THE CHARACTERIZATION OF WEIHRAUCH REDUCIBILITY IN SYSTEMS CONTAINING
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5000259)
