ON WEIHRAUCH REDUCIBILITY AND INTUITIONISTIC REVERSE MATHEMATICS.
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 provabili...
| Publicado en: | Journal of Symbolic Logic Vol. 82; no. 4; pp. 1438 - 1459 |
|---|---|
| Autor principal: | |
| Formato: | Artículo |
| Publicado: |
Cambridge University Press
Dec2017
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=127197697&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 127197697 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00224812 3TY jtl: Journal of Symbolic Logic issn: 00224812 maglogo: N pubinfo: dt: Dec2017 vid: 82 iid: 4 pid: 15979 pub: Cambridge University Press artinfo: ui: 127197697 10.1017/jsl.2016.61 ppf: 1438 ppct: 21 formats: tig: atl: ON WEIHRAUCH REDUCIBILITY AND INTUITIONISTIC REVERSE MATHEMATICS. aug: au: KUYPER, RUTGER affil: SCHOOL OF MATHEMATICS AND STATISTICS VICTORIA UNIVERSITY OF WELLINGTON PO BOX 600, WELLINGTON 6140 NEW ZEALAND su: Reverse mathematics Mathematical logic Reversible computing Mathematical analysis Intuitionistic mathematics sug: subj: Reverse mathematics Mathematical logic Reversible computing Mathematical analysis Intuitionistic mathematics keyword: 03B20 03B30 03D30 03F35 intuitionistic logic reverse mathematics Weihrauch reducibility ab: 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. pubtype: Academic Journal doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2017 holdings: @attributes: islocal: N |
|---|