Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

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 19 990 Ft

DPD point 1 170 Ft DPD courier 1 370 Ft GLS point 1 370 Ft Hungarian Post 1 975 Ft Hungarian Post 1 870 Ft Hungarian Post 1 870 Ft FoxPost 1 370 Ft Packeta point 1 370 Ft GLS courier 1 870 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Computability and Logic

Name: Computability and Logic
Brand: Cambridge University Press
SKU: 04399100
Price: 18026 HUF
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

120 b

18 026 Ft

In stock at our supplier Shipping in 9-13 days

Up to 30 days for returns

Customers also purchased

Proofs and Refutations Imre Lakatos

Paperback

9 162 Ft

Friendly Introduction to Mathematical Logic Christopher C Leary

Paperback

13 264 Ft

Models Mark Manson

Paperback

5 362 Ft

Thinking about Mathematics Stewart Shapiro

Paperback

22 847 Ft

Lying Sam Harris

Hardback

5 541 Ft

The Sublime Object of Ideology Slavoj Zizek

Paperback

6 840 Ft

Molloy, Malone Dies, the Unnamable Samuel Beckett

Hardback

9 464 Ft

Inner Experience Georges Bataille

Paperback

15 258 Ft

Collected Poems Philip Larkin

Paperback

6 453 Ft

Awaiting Oblivion Maurice Blanchot

Paperback

13 011 Ft

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.