THE CHARACTERIZATION OF WEIHRAUCH REDUCIBILITY IN SYSTEMS CONTAINING

DOI10.1017/JSL.2020.53OpenAlexW3013216722MaRDI QIDQ5000259FDOQ5000259

Patrick Uftring

Publication date: 12 July 2021

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.13331

zbMATH Keywords

linear logicphase semanticsWeihrauch reducibilitydialectica interpretationnonstandard arithmetichigher-order computability theory

Mathematics Subject Classification ID

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) Higher-type and set recursion theory (03D65) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Blind Spot
• Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• Weihrauch degrees, omniscience principles and weak computability
• Functional Interpretations of Intuitionistic Linear Logic
• Functional Interpretations of Intuitionistic Linear Logic
• Formal systems for some branches of intuitionistic analysis
• Computational Interpretations of Classical Linear Logic
• A functional interpretation for nonstandard arithmetic
• Intuitionistic Provability versus Uniform Provability in $$\mathsf{RCA}$$
• Using Ramsey's theorem once
• ON WEIHRAUCH REDUCIBILITY AND INTUITIONISTIC REVERSE MATHEMATICS
• Weihrauch and constructive reducibility between existence statements
• Classical consequences of continuous choice principles from intuitionistic analysis

Cited In (4)

• Using Ramsey's theorem once
• The characterization of Weihrauch reducibility in systems containing E-PA$^{\omega}$ + QF-AC$^{0,0}$
• Reduction games, provability and compactness
• Weihrauch Complexity in Computable Analysis

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)