We provide a bibliography on Constructivity, Computability and Complexity
in Analysis which contains references to papers based on classical logic
("computable analysis") as well as to papers based on intuitionistic logic
("constructive analysis"). The bibliography is far from beeing complete, but
it is supposed to grow continuously.
Unclassified Bibliography and Recent Publications
We offer an extraction of our bibliography with very recent publications (of this year and last year),
an unclassified complete version and also a BibTeX version which might be used for citations in LaTeX documents:
Of course, the classification is very rough and there are some papers which cannot
be classified uniquely.
Additionally, we offer a bibliography of PhD theses:
The
CCA Bibliography
is also part of
The Collection of Computer Science Bibliographies,
maintained by Alf-Christian Achilles, University of Karlsruhe. By his kind permission we can offer
the graphic below which shows the distribution of publication years in our bibliography and the search tool above.
Submissions
Please feel free to submit additions, corrections and comments to
.
In case that you would like to submit references to the bibliography,
please try to use the following form:
An earlier version of this bibliography has been published here:
Vasco Brattka and Iraj Kalantari. A bibliography of recursive analysis and recursive topology.
In Yu. L. Ershov, S.S. Goncharov, A. Nerode, and J.B. Remmel (eds.),
Handbook of Recursive Mathematics, vol. 138 of Studies in Logic and the Foundations of Mathematics,
pages 583-620. Elsevier, Amsterdam 1998.
A large part of the bibliography is also due to the
Theoretical Computer Science Group 1
of the University in Hagen and several submissions of other authors.
Submit reference to CCA Bibliography