Computability and LogicComputability 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. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a new and simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems. |
What people are saying - Write a review
We haven't found any reviews in the usual places.
Contents
9780521877527c02_p1622 | 16 |
9780521877527c03_p2334 | 23 |
9780521877527c04_p3544 | 35 |
9780521877527c05_p4562 | 45 |
9780521877527c06_p6372 | 63 |
9780521877527c07_p7387 | 73 |
9780521877527c08_p8898 | 88 |
9780521877527c09_p99113 | 99 |
9780521877527c17_p220231 | 220 |
9780521877527c18_p232240 | 232 |
9780521877527c19_p241259 | 241 |
9780521877527c20_p260269 | 260 |
9780521877527c21_p270278 | 270 |
9780521877527c22_p279285 | 279 |
9780521877527c23_p286294 | 286 |
9780521877527c24_p295301 | 295 |
9780521877527c10_p114125 | 114 |
9780521877527c11_p126136 | 126 |
9780521877527c12_p137152 | 137 |
9780521877527c13_p153165 | 153 |
9780521877527c14_p166186 | 166 |
9780521877527c15_p187198 | 187 |
9780521877527c16_p199219 | 199 |
9780521877527c25_p302318 | 302 |
9780521877527c26_p319326 | 319 |
9780521877527c27_p327340 | 327 |
| 341 | |
| 343 | |
Other editions - View all
Computability and Logic George S. Boolos,John P. Burgess,Richard C. Jeffrey No preview available - 2007 |
Common terms and phrases
addition apply arguments arithmetic assigns atomic axioms begin blank block called chapter code number complete computable condition conjunction consequence consider consistent constant contains correct deducible defined definition denotation derivation disjunction domain effectively elements entry enumerable equivalent Example exists extension fact Figure finite follows formal formula function symbols give given going halt hence holds identity implies induction infinite instance interpretation involving isomorphic language least Lemma less logic matter means natural numbers nonstandard Note notion obtained occur operations pairs positive integers preceding predicate present primitive recursive problem proof Proposition provable prove quantification recursive function relation remainder represented result rules satisfiable semirecursive sequence set of sentences Show specify standard step strokes subset Suppose tape theorem theory true truth Turing machine variables write zero
Popular passages
Page 347 - The special aim of the present edition has been to increase the pedagogical usefulness of the book by adding a selection of problems at the end of each chapter, and by making chapters more independent of each other, so as to increase the range of options available to the instructor or reader as to what to cover and what to defer.
References to this book
Bibliographic information
| Title | Computability and Logic |
| Authors | George S. Boolos, John P. Burgess, Richard C. Jeffrey |
| Edition | illustrated |
| Publisher | Cambridge University Press, 2007 |
| ISBN | 0521877520, 9780521877527 |
| Length | 350 pages |
| Subjects | › Computers / Computer Science Computers / General Mathematics / History & Philosophy Mathematics / Logic Philosophy / Logic |
| Export Citation | BiBTeX EndNote RefMan |