Skip to main content
×
×
Home

ON WEIHRAUCH REDUCIBILITY AND INTUITIONISTIC REVERSE MATHEMATICS

  • RUTGER KUYPER (a1)
Abstract

We show that there is a strong connection between Weihrauch reducibility on one hand, and provability in EL0, the intuitionistic version of RCA0, on the other hand. More precisely, we show that Weihrauch reducibility to the composition of finitely many instances of a theorem is captured by provability in EL0 together with Markov’s principle, and that Weihrauch reducibility is captured by an affine subsystem of EL0 plus Markov’s principle.

Copyright
References
Hide All
[1] Brattka, V. and Gherardi, G., Weihrauch degrees, omniscience principles and weak computability, this Journal, vol. 76 (2011), no. 1, pp. 143176.
[2] Brattka, V., Gherardi, G., and Marcone, A., The Bolzano-Weierstrass theorem is the jump of weak König’s lemma . Annals of Pure and Applied Logic, vol. 163 (2012), pp. 623655.
[3] Brattka, V., Oliva, P., and Pauly, A., On the algebraic structure of Weihrauch degrees, 2013, arXiv:1604.08348.
[4] Buss, S. R. (ed.), Handbook of Proof Theory, Elsevier, Amsterdam, 1998.
[5] Dorais, F. G., Classical consequences of continuous choice principles from intuitionistic analysis . Notre Dame Journal of Formal Logic, vol. 55 (2014), no. 1, pp. 2539.
[6] Dorais, F. G., Dzhafarov, D. D., Hirst, J. L., Mileti, J. R., and Shafer, P., On uniform relationships between combinatorial problems . Transactions of the American Mathematical Society, vol. 368 (2016), pp. 13211359.
[7] Dzhafarov, D. D., Strong reductions between combinatorial principles, this Journal, vol. 81 (2016), no. 4, pp. 14051431.
[8] Fujiwara, M., Intuitionistic provability versus uniform provability in RCA , CiE 2015 (Beckmann, A., Mitrana, V., and Soskova, M., editors), Lecture Notes in Computer Science, vol. 9136, Springer, 2015, pp. 186195.
[9] Hirst, J. L. and Mummert, C., Reverse mathematics and uniformity in proofs without excluded middle . Notre Dame Journal of Formal Logic, vol. 52 (2011), no. 2, pp. 149162.
[10] Kleene, S. C., Formalized Recursive Functionals and Formalized Realizability, Memoirs of the American Mathematical Society, vol. 89, American Mathematical Society, Providence, RI, 1969.
[11] Kohlenbach, U., Higher order reverse mathematics , Reverse Mathematics 2001 (Simpson, S. G., editor), Lecture Notes in Logic, vol. 21, A. K. Peters, Wellesley, MA, 2005, pp. 281295.
[12] Kuroda, S., Intuitionistic investigations of formalist logic . Nagoya Mathematical Journal, vol. 2 (1951), pp. 3547 (in German).
[13] Simpson, S. G., Subsystems of Second Order Arithmetic, Springer-Verlag, New York, NY, 1999.
[14] Troelstra, A. S (ed.), Metamathematical Investigation of Intuitionistic Arithmetic and Analysis, Lecture Notes in Mathematics, vol. 344, Springer, 1973.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 47 *
Loading metrics...

Abstract views

Total abstract views: 322 *
Loading metrics...

* Views captured on Cambridge Core between 15th May 2017 - 15th August 2018. This data will be updated every 24 hours.