Free delivery for orders over 69.99€

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 69.99 €

Speedy courier 3.49 € Speedy point 3.49 € Еконт courier 3.99 € Еконтомат/Офис на Еконт 3.99 € Ekont Box 3.99 € Sameday courier 3.99 € Sameday Box 3.99 € Box Now 3.99 €

Contact

How to shop

Help

My account

▸ Empty :-(

Free delivery for orders over 69.99€

Computability and Logic

Name: Computability and Logic
Brand: Cambridge University Press
SKU: 04399100
Price: 44.89 EUR
Availability: InStock
Author: George S Boolos
ISBN: 9780521701464

George S Boolos

Language

English

Book Paperback

Libristo code: 04399100

Publishers Cambridge University Press, September 2007

Computability and Logic has become a classic because of its accessibility to students without a math... Full description

Libristo code: 04399100

109 b

44.89 €

87.79 лв

In stock at our supplier Shipping in 10-16 days

Up to 30 days for returns

Customers also purchased

Proofs and Refutations Imre Lakatos

Paperback

22.83 € 44.65 лв

Friendly Introduction to Mathematical Logic Christopher C Leary

Paperback

32.91 € 64.36 лв

Models Mark Manson

Paperback

13.62 € 26.64 лв

Thinking about Mathematics Stewart Shapiro

Paperback

65.82 € 128.73 лв

Lying Sam Harris

Hardback

13.83 € 27.05 лв

The Sublime Object of Ideology Slavoj Zizek

Paperback

18.35 € 35.90 лв

Inner Experience Georges Bataille

Paperback

42.01 € 82.16 лв

Molloy, Malone Dies, the Unnamable Samuel Beckett

Hardback

23.60 € 46.16 лв

Collected Poems Philip Larkin

Paperback

16.09 € 31.47 лв

Awaiting Oblivion Maurice Blanchot

Paperback

33.32 € 65.16 лв

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.