Results 1 
6 of
6
A.: How much incomputable is the separable HahnBanach Theorem
 Conference on Computability and Complexity in Analysis. Number 348 in Informatik Berichte, FernUniversität Hagen (2008) 101 – 117
"... Abstract. We determine the computational complexity of the HahnBanach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak König’s Lemma within the framework of computable analysis to classify incomputable ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
(Show Context)
Abstract. We determine the computational complexity of the HahnBanach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak König’s Lemma within the framework of computable analysis to classify incomputable functions of low complexity. By defining the multivalued function Sep and a natural notion of reducibility for multivalued functions, we obtain a computational counterpart of the subsystem of second order arithmetic WKL0. We study analogies and differences between WKL0 and the class of Sepcomputable multivalued functions. Extending work of Brattka, we show that a natural multivalued function associated with the HahnBanach Extension Theorem is Sepcomplete. 1.
Fundamental notions of analysis in subsystems of secondorder arithmetic
 Ann. Pure Appl. Logic
, 2006
"... This Article is brought to you for free and open access by the Dietrich College of Humanities and Social Sciences at Research Showcase @ CMU. It has ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
This Article is brought to you for free and open access by the Dietrich College of Humanities and Social Sciences at Research Showcase @ CMU. It has
The Hilbert problems and Hilbert’s Program
, 2008
"... In 1900 the great mathematician David Hilbert laid down a list of 23 mathematical problems [32] which exercised a great influence on subsequent mathematical research. From the perspective of foundational studies, it is noteworthy that Hilbert’s Problems 1 and 2 are squarely in the area of foundation ..."
Abstract
 Add to MetaCart
In 1900 the great mathematician David Hilbert laid down a list of 23 mathematical problems [32] which exercised a great influence on subsequent mathematical research. From the perspective of foundational studies, it is noteworthy that Hilbert’s Problems 1 and 2 are squarely in the area of foundations of mathematics, while Problems 10 and 17 turned out to be closely related to mathematical logic.
HOW MUCH INCOMPUTABLE IS THE SEPARABLE HAHNBANACH THEOREM?
, 808
"... Abstract. We determine the computational complexity of the HahnBanach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak König’s Lemma within the framework of computable analysis to classify incomputable ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We determine the computational complexity of the HahnBanach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak König’s Lemma within the framework of computable analysis to classify incomputable functions of low complexity. By defining the multivalued function Sep and a natural notion of reducibility for multivalued functions, we obtain a computational counterpart of the subsystem of second order arithmetic WKL0. We study analogies and differences between WKL0 and the class of Sepcomputable multivalued functions. Extending work of Brattka, we show that a natural multivalued function associated with the HahnBanach Extension Theorem is Sepcomplete. 1.
unknown title
"... Fundamental notions of analysis in subsystems of secondorder arithmetic ..."
(Show Context)