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
II | v |
III | ix |
IV | 4 |
V | 11 |
VI | 23 |
VIII | 28 |
IX | 33 |
X | 39 |
XXXIX | 180 |
XL | 184 |
XLI | 187 |
XLII | 195 |
XLIII | 200 |
XLIV | 204 |
XLV | 208 |
XLVI | 212 |
XI | 45 |
XII | 51 |
XIII | 58 |
XIV | 61 |
XV | 68 |
XVI | 71 |
XVII | 76 |
XVIII | 82 |
XIX | 84 |
XX | 89 |
XXI | 94 |
XXII | 102 |
XXIV | 107 |
XXV | 114 |
XXVI | 120 |
XXVII | 125 |
XXVIII | 130 |
XXIX | 134 |
XXX | 141 |
XXXI | 144 |
XXXII | 145 |
XXXIII | 148 |
XXXIV | 150 |
XXXV | 154 |
XXXVI | 162 |
XXXVII | 167 |
XXXVIII | 175 |
XLVII | 214 |
XLVIII | 220 |
XLIX | 229 |
L | 231 |
LI | 235 |
LII | 241 |
LIII | 243 |
LIV | 248 |
LV | 252 |
LVI | 253 |
LVII | 258 |
LVIII | 261 |
LIX | 263 |
LX | 267 |
LXI | 274 |
LXII | 277 |
LXIII | 283 |
LXIV | 290 |
LXV | 294 |
LXVI | 300 |
LXVII | 307 |
LXVIII | 310 |
LXIX | 315 |
LXX | 322 |
LXXI | 325 |
LXXII | 329 |
Other editions - View all
Computability and Logic George S. Boolos,John P. Burgess,Richard C. Jeffrey No preview available - 2007 |
Common terms and phrases
arguments arithmetically definable atomic formulas atomic sentence axioms blank block called chapter Church’s thesis closed term code number compactness theorem conjunction consider consistent constant contains Corollary deducible definition denotation derivation diagonal lemma disjunction domain effectively computable elements entry Example existential quantification finite set finite subset first-order first-order logic flow chart follows formal function f function symbols given hence identity implies infinite isomorphic L¨owenheim–Skolem theorem language of arithmetic leftmost Lemma monadic logic natural numbers negation nonenumerable nonlogical symbols nonstandard model normal form notation notion obtained one-place pairs positive integers primitive recursive function Proposition provable prove rational numbers real numbers recursive set recursive total function result right number rudimentary formula satisfiable scanning second-order logic semirecursive set of sentences sets of natural Show Skolem standard interpretation strokes subformula Suppose tape theory total function Turing computable Turing machine universal quantification variables write xB(x xF(x 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 |