ON WEIHRAUCH REDUCIBILITY AND INTUITIONISTIC REVERSE MATHEMATICS
From MaRDI portal
Publication:4600462
DOI10.1017/jsl.2016.61zbMath1421.03003arXiv1511.05189OpenAlexW2963034860MaRDI QIDQ4600462
Publication date: 11 January 2018
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.05189
Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Other degrees and reducibilities in computability and recursion theory (03D30) Subsystems of classical logic (including intuitionistic logic) (03B20)
Related Items
Effectivity and reducibility with ordinal Turing machines, Reduction games, provability and compactness, On the algebraic structure of Weihrauch degrees, Using Ramsey's theorem once, INTERRELATION BETWEEN WEAK FRAGMENTS OF DOUBLE NEGATION SHIFT AND RELATED PRINCIPLES, Weihrauch and constructive reducibility between existence statements, THE CHARACTERIZATION OF WEIHRAUCH REDUCIBILITY IN SYSTEMS CONTAINING, Parallelizations in Weihrauch reducibility and constructive reverse mathematics, Weihrauch Complexity in Computable Analysis
Cites Work
- Unnamed Item
- Unnamed Item
- The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
- Reverse mathematics and uniformity in proofs without excluded middle
- Handbook of proof theory
- Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
- Classical consequences of continuous choice principles from intuitionistic analysis
- On uniform relationships between combinatorial problems
- STRONG REDUCTIONS BETWEEN COMBINATORIAL PRINCIPLES
- Weihrauch degrees, omniscience principles and weak computability
- Intuitionistic Provability versus Uniform Provability in $$\mathsf{RCA}$$
- Formalized recursive functionals and formalized realizability
- Intuitionistische Untersuchungen der formalistischen Logik
