347 search results - page 9 / 70 » Computable Versions of Basic Theorems in Functional Analysis |
ICALP
2004
Springer
15 years 2 months ago
2004
Springer
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...
116
Voted
TYPES
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. In the FTA project in Nijmegen we have formalized a constructive proof of the Fundamental Theorem of Algebra. In the formalization, we have first defined the (constructiv...
IGPL
2008
14 years 9 months ago
2008
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
CSFW
2005
IEEE
15 years 3 months ago
2005
IEEE
In the analysis of security protocols, the knowledge of attackers is often described in terms of message deducibility and indistinguishability relations. In this paper, we pursue ...
ICALP
2004
Springer
15 years 2 months ago
2004
Springer
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...