ON WEIHRAUCH REDUCIBILITY AND INTUITIONISTIC REVERSE MATHEMATICS

被引：8

作者：

Kuyper, Rutger ^{[1
]}

机构：

[1] Victoria Univ Wellington, Sch Math & Stat, POB 600, Wellington 6140, New Zealand

来源：

JOURNAL OF SYMBOLIC LOGIC | 2017年 / 82卷 / 04期

关键词：

reverse mathematics; Weihrauch reducibility; intuitionistic logic; PRINCIPLES;

D O I：

10.1017/jsl.2016.61

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We show that there is a strong connection between Weihrauch reducibility on one hand, and provability in EL0, the intuitionistic version of RCA(0), 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.

引用

页码：1438 / 1458

页数：21

共 50 条

[1] Parallelizations in Weihrauch Reducibility and Constructive Reverse Mathematics
Fujiwara, Makoto
[J]. BEYOND THE HORIZON OF COMPUTABILITY, CIE 2020, 2020, 12098 : 38 - 49
[2] On the reverse mathematics and Weihrauch complexity of moduli of regularity and uniqueness
Kohlenbach, Ulrich
[J]. COMPUTABILITY-THE JOURNAL OF THE ASSOCIATION CIE, 2019, 8 (3-4): : 377 - 387
[3] THE DEGREE STRUCTURE OF WEIHRAUCH REDUCIBILITY
Higuchi, Kojiro
Pauly, Arno
[J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2013, 9 (02)
[4] The degree structure of Weihrauch reducibility
[J]. Higuchi, K. (sa7m24@math.tohoku.ac.jp), 1600, Logical Methods in Computer Science (09):
[5] INSTANCE REDUCIBILITY AND WEIHRAUCH DEGREES
Bauer, Andrej
[J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2022, 18 (03)
[6] Reverse mathematics and Weihrauch analysis motivated by finite complexity theory
BeMent, Zach
Hirst, Jeffry
Wallace, Asuka
[J]. COMPUTABILITY-THE JOURNAL OF THE ASSOCIATION CIE, 2021, 10 (04): : 343 - 354
[7] Weihrauch and constructive reducibility between existence statements
Fujiwara, Makoto
[J]. COMPUTABILITY-THE JOURNAL OF THE ASSOCIATION CIE, 2021, 10 (01): : 17 - 30
[8] Cardinal invariants, non-lowness classes, and Weihrauch reducibility
Greenberg, Noam
Kuyper, Rutger
Turetsky, Dan
[J]. COMPUTABILITY-THE JOURNAL OF THE ASSOCIATION CIE, 2019, 8 (3-4): : 305 - 346
[9] Reducibility of domain representations and Cantor-Weihrauch domain representations
Blanck, Jens
[J]. MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2008, 18 (06) : 1031 - 1056
[10] MATHEMATICS IN ECONOMICS: REDUCIBILITY AND/OR APPLICABILITY?
Sarukkai, Sundar
[J]. NEW MATHEMATICS AND NATURAL COMPUTATION, 2012, 8 (01) : 81 - 93

← 1 2 3 4 5 →