Computability and Logic

Name: Computability and Logic
Price: 11.0 USD
Availability: InStock
ISBN: 9780521701464

ISBN-10: 0521701465

ISBN-13: 9780521701464

Edition: 5th 2007 (Revised)

Authors: George S. Boolos, John P. Burgess, Richard C. Jeffrey

List price: $38.99

30 day, 100% satisfaction guarantee!

Sell

Get cash fast!

Buy new: $30.13

Marketplace

5 new & used from $11.00

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

Description:

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. 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.

Book details

List price: $38.99
Edition: 5th
Copyright year: 2007
Publisher: Cambridge University Press
Publication date: 9/17/2007
Binding: Paperback
Pages: 366
Size: 7.01" wide x 10.00" long x 0.75" tall
Weight: 1.826
Language: English

George Boolos was Professor of Philosophy, Massachusetts Institute of Technology.




Computability Theory



Enumerability



Diagonalization



Turing computability



Uncomputability



Abacus computability



Recursive functions



Recursive sets and relations



Equivalent definitions of computability



Basic Metalogic



A precis of first-order logic: syntax



A precis of first-order logic: semantics



The undecidability of first-order logic



Models



The existence of models



Proofs and completeness



Arithmetization



Representability of recursive functions



Indefinability, undecidability, incompleteness



The unprovability of consistency



Further Topics



Normal forms



The Craig interpolation theorem



Monadic and dyadic logic



Second-order logic



Arithmetical definability



Decidability of arithmetic without multiplication



Non-standard models



Ramsey's theorem



Modal logic and provability