 | |
Some recent publications:
- Vasco Brattka, Matthew de Brecht and Arno Pauly.
Closed choice and a Uniform Low Basis Theorem.
Annals of Pure and Applied Logic, 163(8):986-1008, 2012.
- Vasco Brattka, Guido
Gherardi and Alberto Marcone.
The Bolzano-Weierstrass Theorem is the jump of Weak König's Lemma.
Annals of Pure and Applied Logic, 163(6):623-655, 2012.
- Vasco Brattka and Guido
Gherardi.
Weihrauch Degrees, Omniscience Principles and Weak Computability.
Journal of Symbolic Logic, 76(1):143-176, 2011.
- Vasco Brattka and Guido
Gherardi.
Effective Choice and Boundedness Principles in Computable Analysis.
Bulletin of Symbolic Logic, 17(1):73-117, 2011.
- Vasco Brattka and Ruth Dillhage.
Computability of finite-dimensional linear subspaces and best approximation.
Annals of Pure and Applied Logic, 162:182-193, 2010.
- Vasco Brattka.
A computable version of Banach's inverse mapping theorem.
Annals of Pure and Applied Logic, 157:85-96, 2009.
- Vasco Brattka and Guido
Gherardi.
Borel complexity of
topological operations on computable metric spaces.
Journal of Logic and Computation, 19(1):45-76, 2009.
- Margaret Archibald, Vasco
Brattka, and Clemens Heuberger.
Randomness with respect to the
signed-digit representation.
Fundamenta Informaticae, 83(1-2):1-19, 2008.
- Vasco Brattka.
Borel complexity and
computability of the Hahn-Banach Theorem.
Archive for Mathematical Logic, 46(7-8):547-564, 2008.
- Vasco Brattka.
Plottable real number functions
and the computable graph theorem.
SIAM Journal on Computing, 38(1):303-328, 2008.
- Vasco Brattka, Peter
Hertling, and Klaus Weihrauch.
A tutorial on
computable analysis.
In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, New
Computational Paradigms: Changing Conceptions of What is Computable,
pages 425-491. Springer, New York, 2008.
- Vasco Brattka.
From Hilbert's 13th Problem to the theory of neural networks: constructive
aspects of Kolmogorov's Superposition Theorem.
In Éric Charpentier, Annick Lesne, and Nikolai Nikolski,
editors, Kolmogorov's Heritage in Mathematics, pages 253-280.
Springer, Berlin, 2007.
- Vasco Brattka and Ruth
Dillhage.
On computable compact
operators on computable Banach spaces with bases.
Mathematical Logic Quarterly, 53(4-5):345-364, 2007.
- Vasco Brattka and
Atsushi Yoshikawa.
Towards computability of
elliptic boundary value problems in variational formulation.
Journal of Complexity, 22(6):858-880, 2006.
- Vasco Brattka.
Computability on non-separable Banach spaces and Landau's theorem.
In Laura Crosilla and Peter Schuster, editors, From Sets and Types to
Topology and Analysis: Towards Practicable Foundations for Constructive
Mathematics, pages 316-333. Oxford University Press, 2005.
- Vasco Brattka.
Effective Borel
measurability and reducibility of functions.
Mathematical Logic Quarterly, 51(1):19-44, 2005.
- Vasco Brattka and Ruth
Dillhage.
Computability of the spectrum of self-adjoint operators.
Journal of Universal Computer Science, 11(12):1884-1900, 2005.
- Vasco Brattka and
Matthias Schröder.
Computing with sequences, weak
topologies and the axiom of choice.
In Luke Ong, editor, Computer science logic, volume 3634 of
Lecture Notes in Computer Science, pages 462-476. Springer,
2005.
|
|
