THE CHARACTERIZATION OF WEIHRAUCH REDUCIBILITY IN SYSTEMS CONTAINING
DOI10.1017/jsl.2020.53OpenAlexW3013216722MaRDI QIDQ5000259
Publication date: 12 July 2021
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.13331
linear logicphase semanticsWeihrauch reducibilitydialectica interpretationnonstandard arithmetichigher-order computability theory
Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Other degrees and reducibilities in computability and recursion theory (03D30) Higher-type and set recursion theory (03D65)
Related Items (3)
Cites Work
- A functional interpretation for nonstandard arithmetic
- Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
- Using Ramsey's theorem once
- Classical consequences of continuous choice principles from intuitionistic analysis
- Weihrauch degrees, omniscience principles and weak computability
- The Blind Spot
- Intuitionistic Provability versus Uniform Provability in $$\mathsf{RCA}$$
- Computational Interpretations of Classical Linear Logic
- ON WEIHRAUCH REDUCIBILITY AND INTUITIONISTIC REVERSE MATHEMATICS
- Weihrauch and constructive reducibility between existence statements
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- Formal systems for some branches of intuitionistic analysis
- Functional Interpretations of Intuitionistic Linear Logic
- Functional Interpretations of Intuitionistic Linear Logic
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: THE CHARACTERIZATION OF WEIHRAUCH REDUCIBILITY IN SYSTEMS CONTAINING