Affiliation:
1. Institut für mathematische, naturwissenschaftliche und technische Bildung, Abteilung für Mathematik und ihre Didaktik, Europa-Universität Flensburg, Germany. merlin.carl@uni-flensburg.de
Abstract
This article expands our work in (LNCS 9709 (2016), 225–233). By its reliance on Turing computability, the classical theory of effectivity, along with effective reducibility and Weihrauch reducibility, is only applicable to objects that are either countable or can be encoded by countable objects. We propose a notion of effectivity based on Koepke’s Ordinal Turing Machines (OTMs) that applies to arbitrary set-theoretical Π 2 -statements, along with according variants of effective reducibility and Weihrauch reducibility. As a sample application, we compare various choice principles with respect to effectivity.
Subject
Artificial Intelligence,Computational Theory and Mathematics,Computer Science Applications,Theoretical Computer Science
Reference23 articles.
1. Existence of bases implies the axiom of choice
2. The Bolzano–Weierstraß theorem is the Jump of weak König’s lemma;Brattka;Annals of Pure and Applied Logic,2012
3. V. Brattka, S. Roux and A. Pauly, Connected choice and the Brouwer fixed point theorem, Journal of Mathematical Logic 19 (2012).
4. M. Carl, Towards a Church-Turing-Thesis for Infinitary Computations, 2013.
5. M. Carl, Generalized effective reducibility, in: LNCS, Vol. 9709, 2016, pp. 225–233. ISBN 978-3-319-40188-1.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献