- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
On Weihrauch reducibility and intuitionistic reverse mathematics
Journal of Symbolic Logic 82 (4):1438-1458 (2017)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Using Ramsey’s theorem once.Jeffry L. Hirst & Carl Mummert - 2019 - Archive for Mathematical Logic 58 (7-8):857-866.
The open and clopen Ramsey theorems in the Weihrauch lattice.Alberto Marcone & Manlio Valenti - 2021 - Journal of Symbolic Logic 86 (1):316-351.
Weihrauch Goes Brouwerian.Vasco Brattka & Guido Gherardi - 2020 - Journal of Symbolic Logic 85 (4):1614-1653.
Searching for an analogue of atr0 in the Weihrauch lattice.Takayuki Kihara, Alberto Marcone & Arno Pauly - 2020 - Journal of Symbolic Logic 85 (3):1006-1043.
The characterization of Weihrauch reducibility in systems containing e-pa ω + qf-ac0;0.Patrick Uftring - forthcoming - Journal of Symbolic Logic:1-35.
On the (semi)lattices induced by continuous reducibilities.Arno Pauly - 2010 - Mathematical Logic Quarterly 56 (5):488-502.
The characterization of Weihrauch reducibility in systems containing.Patrick Uftring - 2021 - Journal of Symbolic Logic 86 (1):224-261.
Reverse Mathematics and Completeness Theorems for Intuitionistic Logic.Takeshi Yamazaki - 2001 - Notre Dame Journal of Formal Logic 42 (3):143-148.
Reduction games, provability and compactness.Damir D. Dzhafarov, Denis R. Hirschfeldt & Sarah Reitzes - 2022 - Journal of Mathematical Logic 22 (3).
The Logic of Interactive Turing Reduction.Giorgi Japaridze - 2007 - Journal of Symbolic Logic 72 (1):243 - 276.
Analytics
Added to PP
2017-05-16
Downloads
36 (#458,158)
6 months
8 (#415,230)
2017-05-16
Downloads
36 (#458,158)
6 months
8 (#415,230)
Historical graph of downloads
Citations of this work
Using Ramsey’s theorem once.Jeffry L. Hirst & Carl Mummert - 2019 - Archive for Mathematical Logic 58 (7-8):857-866.
Reduction games, provability and compactness.Damir D. Dzhafarov, Denis R. Hirschfeldt & Sarah Reitzes - 2022 - Journal of Mathematical Logic 22 (3).
References found in this work
Chapter 1: An introduction to proof theory & Chapter 2: Firstorder proof theory of arithmetic.S. Buss - 1998 - In Samuel R. Buss (ed.), Handbook of proof theory. New York: Elsevier.
The Bolzano–Weierstrass Theorem is the jump of Weak Kőnig’s Lemma.Vasco Brattka, Guido Gherardi & Alberto Marcone - 2012 - Annals of Pure and Applied Logic 163 (6):623-655.
Classical Consequences of Continuous Choice Principles from Intuitionistic Analysis.François G. Dorais - 2014 - Notre Dame Journal of Formal Logic 55 (1):25-39.
Reverse Mathematics and Uniformity in Proofs without Excluded Middle.Jeffry L. Hirst & Carl Mummert - 2011 - Notre Dame Journal of Formal Logic 52 (2):149-162.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-68866f4b87-zhzfn uwo