Cambridge, England: Cambridge University Press (1974)
| Authors |
|
| Abstract |
Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, such as Godel's incompleteness theorems, but also a large number of optional topics, from Turing's theory of computability to Ramsey's theorem. This 2007 fifth edition has been thoroughly revised by John Burgess. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems. This updated edition is also accompanied by a website as well as an instructor's manual.
|
| Keywords | abacus computable functions |
| Categories | (categorize this paper) |
| Reprint years | 2005, 2007, 2008, 2012 |
| Buy this book | $7.59 used $9.99 new $19.76 from Amazon Amazon page |
| ISBN(s) | 0521389232 0511804075 9780511804076 9780511074950 9780521701464 0521809754 9780511364297 0521007585 0521877520 0521701465 9781107049277 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
PhilArchive copy
Upload a copy of this paper Check publisher's policy Papers currently archived: 71,172
External links
(no proxy) Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
- Sign in / register and customize your OpenURL resolver..
- Configure custom resolver
References found in this work BETA
No references found.
Citations of this work BETA
Counterpossibles in Science: The Case of Relative Computability.Matthias Jenny - 2018 - Noûs 52 (3):530-560.
Factive Knowability and the Problem of Possible Omniscience.Jan Heylen - 2020 - Philosophical Studies 177 (1):65-87.
Software Intensive Science.John Symons & Jack Horner - 2014 - Philosophy and Technology 27 (3):461-477.
View all 44 citations / Add more citations
Similar books and articles
Computability and Logic.George Boolos, John Burgess, Richard P. & C. Jeffrey - 2002 - Cambridge University Press.
Computability: Computable Functions, Logic, and the Foundations of Mathematics.Richard L. Epstein - 1989
Remarks on the Development of Computability.Stewart Shapiro - 1983 - History and Philosophy of Logic 4 (1-2):203-220.
Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory.Robert I. Soare - 2009 - Annals of Pure and Applied Logic 160 (3):368-399.
Computability, an Introduction to Recursive Function Theory.Nigel Cutland - 1980 - Cambridge University Press.
A First Course in Logic: An Introduction to Model Theory, Proof Theory, Computability, and Complexity.Shawn Hedman - 2004 - Oxford, England: Oxford University Press.
George S. Boolos, John P. Burgess, Richard C. Jeffrey, Computability and Logic.Marcin Tkaczyk - 2007 - Roczniki Filozoficzne:271-276.
Consistency, Turing Computability and Gödel’s First Incompleteness Theorem.Robert F. Hadley - 2008 - Minds and Machines 18 (1):1-15.
What is Mathematical Logic?John Newsome Crossley (ed.) - 1972 - London and New York: Dover Publications.
Soundness and Completeness of the Cirquent Calculus System CL6 for Computability Logic.Wenyan Xu & Sanyang Liu - 2012 - Logic Journal of the IGPL 20 (1):317-330.
Analytics
Added to PP index
2016-02-04
Total views
6 ( #1,136,980 of 2,517,879 )
Recent downloads (6 months)
2 ( #272,606 of 2,517,879 )
2016-02-04
Total views
6 ( #1,136,980 of 2,517,879 )
Recent downloads (6 months)
2 ( #272,606 of 2,517,879 )
How can I increase my downloads?
Downloads
