Comparing the theory of representations and constructive mathematics
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].
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction
- Predicative functionals and an interpretation of \({\widehat{\text{ID}}_{<\omega}}\)
- Representations and the foundations of mathematics
- On the (semi)lattices induced by continuous reducibilities
- Intuitionistic provability versus uniform provability in \(\mathsf{RCA}\)
- scientific article; zbMATH DE number 6917933 (Why is no real title available?)
- Weihrauch goes Brouwerian
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)