1 / 36A logical approach to computable analysis In this talk I present a logical approach to computable analysis based on program extraction from proofs. I’ll explain the basic principle, give some examples and highlight aspects that might make this approach interesting to people working in computable analysis. The main attraction of the approach is, in my opinion, the fact that one can work directly with abstract mathematical objects without having to construct particular representations. The work reported in this talk is joint with Monika Seisenberge
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.