Switch to: Citations

References in:

Computability and complexity

Stanford Encyclopedia of Philosophy (2008)

Add references

You must login to add references.
  1. The Universal Computer. The Road from Leibniz to Turing.Martin Davis - 2001 - Bulletin of Symbolic Logic 7 (1):65-66.
    Direct download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Introduction to metamathematics.Stephen Cole Kleene - 1952 - Groningen: P. Noordhoff N.V..
    Stephen Cole Kleene was one of the greatest logicians of the twentieth century and this book is the influential textbook he wrote to teach the subject to the next generation. It was first published in 1952, some twenty years after the publication of Godel's paper on the incompleteness of arithmetic, which marked, if not the beginning of modern logic. The 1930s was a time of creativity and ferment in the subject, when the notion of computable moved from the realm of (...)
  • Principia Mathematica.Alfred North Whitehead & Bertrand Russell - 1950 - Cambridge,: Franklin Classics. Edited by Bertrand Russell.
    This work has been selected by scholars as being culturally important and is part of the knowledge base of civilization as we know it. This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work. Scholars believe, and we concur, that this work is important enough to be (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   83 citations  
  • On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
  • Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
    Direct download  
     
    Export citation  
     
    Bookmark   594 citations  
  • The Theory of Algorithms.A. A. Markov - 1953 - Journal of Symbolic Logic 18 (4):340-341.
    Direct download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Reducibility Among Combinatorial Problems.Richard M. Karp, Raymond E. Miller & James W. Thatcher - 1975 - Journal of Symbolic Logic 40 (4):618-619.
    Direct download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Descriptive Complexity.Neil Immerman - 1998 - Springer Verlag.
    This book is a relatively self-contained introduction to the subject, which includes the necessary background material, as well as numerous examples and exercises.
  • Godel, Escher, Bach: An Eternal Golden Braid.Douglas Richard Hofstadter - 1979 - Hassocks, England: Basic Books.
    A young scientist and mathematician explores the mystery and complexity of human thought processes from an interdisciplinary point of view.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   505 citations  
  • Alan Turing: the Enigma.Andrew Hodges - 1985 - Journal of Symbolic Logic 50 (4):1065-1067.
    Direct download  
     
    Export citation  
     
    Bookmark   115 citations  
  • Computers and Intractability. A Guide to the Theory of NP-Completeness.Michael R. Garey & David S. Johnson - 1983 - Journal of Symbolic Logic 48 (2):498-500.
    Direct download  
     
    Export citation  
     
    Bookmark   223 citations  
  • The Intrinsic Computational Difficulty of Functions.Alan Cobham - 1965 - In Yehoshua Bar-Hillel (ed.), Logic, Methodology and Philosophy of Science: Proceedings of the 1964 International Congress (Studies in Logic and the Foundations of Mathematics). North-Holland Publishing. pp. 24-30.
  • An Unsolvable Problem of Elementary Number Theory.Alonzo Church - 1936 - Journal of Symbolic Logic 1 (2):73-74.
  • A note on the entscheidungsproblem.Alonzo Church - 1936 - Journal of Symbolic Logic 1 (1):40-41.
  • From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931.Jean van Heijenoort (ed.) - 1967 - Cambridge, MA, USA: Harvard University Press.
    Gathered together here are the fundamental texts of the great classical period in modern logic. A complete translation of Gottlob Frege's Begriffsschrift--which opened a great epoch in the history of logic by fully presenting propositional calculus and quantification theory--begins the volume, which concludes with papers by Herbrand and by Gödel.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   44 citations  
  • Grundzüge der theoretischen Logik.D. Hilbert & W. Ackermann - 1928 - Annalen der Philosophie Und Philosophischen Kritik 7:157-157.
    No categories
     
    Export citation  
     
    Bookmark   202 citations  
  • A Mathematical Introduction to Logic.Herbert Enderton - 2001 - Bulletin of Symbolic Logic 9 (3):406-407.
     
    Export citation  
     
    Bookmark   182 citations  
  • The Classical Decision Problem.Egon Börger, Erich Grädel & Yuri Gurevich - 2000 - Studia Logica 64 (1):140-143.
     
    Export citation  
     
    Bookmark   33 citations