Extracting Computable Bounds (and Algorithms) from Classical Existence Proofs: Girard Domains Enable Us to Go Beyond Local Compactness
Владик Крейнович, Karen Villaverde · scholarworks - UTEP (The University of Texas at El Paso) · 2008
1 Introduction In classical mathematics, the existence of a solution is often proven indirectly,non-constructively, without an efficient method for constructing the corresponding object. This non-constructivity was the main starting point for constructive 1