Effective Choice and Boundedness Principles in Computable Analysis

DOI10.4230/OASICS.CCA.2009.2262zbMath1247.03128OpenAlexW2736087842MaRDI QIDQ2917342

Vasco Brattka, Guido Gherardi

Publication date: 28 September 2012

Full work available at URL: https://dblp.uni-trier.de/db/conf/cca/cca2009.html#BrattkaG09a

zbMATH Keywords

reverse mathematicscomputable analysisconstructive analysiseffective descriptive set theory

Mathematics Subject Classification ID

Descriptive set theory (03E15) Constructive and recursive analysis (03F60) Second- and higher-order arithmetic and fragments (03F35) Constructive operator theory (47S30) Constructive functional analysis (46S30)

Related Items (2)

Well-Quasi Orders and Hierarchy Theory ⋮ On the (semi)lattices induced by continuous reducibilities

This page was built for publication: Effective Choice and Boundedness Principles in Computable Analysis