Bibliographic Database for Computability Theory
The bibliographic database for Computability Theory can be found in
several different formats:
I will try to continuously update the database. Last updated on
As of 10/25/95 we are using the abbreviations used and approved by Math
As of March 1 1996, we are using the program BibTool (this program no longer has a web page but can be found on ctan)
with the resource file bibtoolrsc to
maintain the database.
This program automaticly assigns the citation keys with the
following format: "String1:String2". String1 is
"Author1.Author2" if one or two authors (or editors),
"Author1.Author2.ea" if three or more authors (or editors) and
"Anon" if no authors or editors. String2 is "xx*y" where "xx" is
the last 2 numbers of the year or "nd" if the year does not exits
and "*y" is added (if needed) to make the key unique.
Maintaining the bibliographic database
This service will only work if all the people who use it help
maintain it. To update entries or to add entries email them to
Other sites and searching the bibliographic
This database is included in "A
Collection of Computer Science Bibliographies" (see http://liinwww.ira.uka.de/bibliography/Theory/computability.html).
This collection is mirrored at several other sites; please use
the one nearest to you. The advantage of using these sites is
that several search engines are included. While these sites may
not always be up-to-date they are searchable. Hence I have no
plans to add a search engine to this site.
Thanks to Bill Gasarch, Ted
Slaman, and Mike Stob.
Be sure to check out the Computability
Theory Web page.
Maintained by Peter Cholak.