Comparing the theory of representations and constructive mathematics

From MaRDI portal





The author investigates the analogy between reducibility results in K. Weihrauch's theory of representations (TR) and theorems of constructive mathematics (CM). Section 2 introduces TR, while Section 3 shows that a constructive proof of an inclusion or equality statement generates a (constructively proved) reducibility statement. Section 4 treats statements formalizable in the language of elementary analysis, the next sections giving evidence that function realizability provides a key understanding of the CM--TR analogy. The result of the present analysis could help to select the mathematically best behaved representations depending on the logical form of their domain definitions. For the entire collection see [Zbl 0772.68004].











This page was built for publication: Comparing the theory of representations and constructive mathematics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4202959)