Effective Choice and Boundedness Principles in Computable Analysis
Work
Year: 2011
Type: article
Abstract: In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably... more
Source: Bulletin of Symbolic Logic
Authors Vasco Brattka, Guido Gherardi
Institutions University of Cape Town, University of Bologna
Cites: 56
Cited by: 118
Related to: 10
FWCI: 11.34
Citation percentile (by year/subfield): 97.11
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green