THE CHARACTERIZATION OF WEIHRAUCH REDUCIBILITY IN SYSTEMS CONTAINING

DOI10.1017/JSL.2020.53MaRDI QIDQ5000259zbMATH OpenOpenAlexFDO

Authors 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)

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

• 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?)
• 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
• 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 Dialectica interpretation of first-order classical affine logic
• The blind spot. Lectures on logic
• Using Ramsey's theorem once
• Weihrauch and constructive reducibility between existence statements
• Weihrauch degrees, omniscience principles and weak computability

Cited in

(4)

• The characterization of Weihrauch reducibility in systems containing E-PA$^{\omega}$ + QF-AC$^{0,0}$
• Using Ramsey's theorem once
• 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)