Computability, Complexity, Logic

Studia Logica 49 (4):610-611 (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,607

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Computability, complexity, logic.Egon Börger - 1989 - New York, N.Y., U.S.A.: Elsevier Science Pub. Co..
The classical decision problem, Egon börger, Erich grädel, and Yuri Gurevich.Maarten Marx - 1999 - Journal of Logic, Language and Information 8 (4):478-481.
Egon Börger. Berechenbarkeit, Komplexität, Logik. Eine Einführung in Algorithmen, Sprachen und Kalküle unter besonderer Berücksichtigung ihrer Komplexität. Edited by Dieter Rödding. Friedr. Vieweg & Sohn, Brunswick and Wiesbaden1985, xvii + 469 pp. - Egon Börger. Berechenbarkeit, Komplexität, Logik. Eine Einführung in Algorithmen, Sprachen und Kalküle unter besonderer Berücksichtigung ihrer Komplexität. Edited by Dieter Rodding. Second corrected edition of the preceding. Friedr. Vieweg & Sohn, Brunswick and Wiesbaden1986, xvii + 469 pp. [REVIEW]Dirk Siefkes - 1989 - Journal of Symbolic Logic 54 (4):1490-1493.
S. Barry Cooper, computability theory.Lars Kristiansen - 2007 - Studia Logica 86 (1):145-146.
Theories of Computability.Nicholas Pippenger - 2001 - Studia Logica 67 (1):140-141.
Definability and Computability.Yuri L. Ershov - 1998 - Studia Logica 61 (3):439-441.
Coherence and complexity of quantifier-free dependence logic formulas.Jarmo Kontinen - forthcoming - Studia Logica.
Incomplete information: Structure, inference, complexity.Jouni Järvinen - 2006 - Studia Logica 84 (3):469-475.
Conference on Computability, Complexity and Randomness.Verónica Becher, C. T. Chong, Rod Downey, Noam Greenberg, Antonin Kucera, Bjørn Kjos-Hanssen, Steffen Lempp, Antonio Montalbán, Jan Reimann & Stephen Simpson - 2008 - Bulletin of Symbolic Logic 14 (4):548-549.
Computability Issues for Adaptive Logics in Multi-Consequence Standard Format.Sergei P. Odintsov & Stanislav O. Speranski - 2013 - Studia Logica 101 (6):1237-1262.

Analytics

Added to PP
2017-02-21

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

Beyond the universal Turing machine.Jack Copeland - 1999 - Australasian Journal of Philosophy 77 (1):46-67.

Add more citations

References found in this work

No references found.

Add more references