347 search results - page 1 / 70 » Computable Versions of Basic Theorems in Functional Analysis |
CCA
2005
Springer
14 years 25 days ago
2005
Springer
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
MFCS
2001
Springer
14 years 3 months ago
2001
Springer
We study different computable versions of Baire’s Category Theorem in computable analysis. Similarly, as in constructive analysis, different logical forms of this theorem lead ...
AML
2007
13 years 11 months ago
2007
Abstract. This research is motivated by the program of Reverse Mathematics. We investigate basic part of complex analysis within some weak subsystems of second order arithmetic, in...
JAR
2007
13 years 10 months ago
2007
ACL2(r) is a modified version of the theorem prover ACL2 that adds support for the irrational numbers using non-standard analysis. It has been used to prove basic theorems of anal...
BSL
2006
13 years 11 months ago
2006
We give a self-contained and streamlined version of the classification of the provably computable functions of PA. The emphasis is put on illuminating as good as seems possible th...