Brezplačna dostava za naročila nad 69.99 € na paketomatih Pošte Slovenije.

Preverjanje stanja naročila

Postanite del skupnosti ljubiteljev knjig z vsega sveta in uživajte v številnih ugodnostih. Ustvarite brezplačen račun

Brezplačna dostava Zásilkovna nad 69.99 €

Zbirna točka GLS 4.49 € Zbirna točka DPD 2.99 € Kurirska služba GLS 5.49 € Kurir DPD 3.49 € Kurirska služba 3.49 € Zbirno mesto 3.49 € Zbirno mesto 3.49 € Dostava preko Pošte Slovenije 3.49 €

Kontakt

Kako nakupovati

Pomoč

Moj račun

▸ Prazna :-(

Brezplačna dostava za naročila nad 69.99 € na paketomatih Pošte Slovenije.

Computability and Logic

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

George S Boolos

Jezik

Angleščina

Knjiga Mehka

Koda Libristo: 04399100

Založba Cambridge University Press, september 2007

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

Koda Libristo: 04399100

104 b

43.03 €

Na zalogi pri dobavitelju Odposlali bomo v 9-15 dneh

30 dni za vračilo blaga

Drugi so kupili tudi

Proofs and Refutations Imre Lakatos

Mehka

21.06 €

Models Mark Manson

Mehka

12.35 €

Thinking about Mathematics Stewart Shapiro

Mehka

45.97 €

Lying Sam Harris

Trda

13.16 €

Friendly Introduction to Mathematical Logic Christopher C Leary

Mehka

31.49 €

Molloy, Malone Dies, the Unnamable Samuel Beckett

Trda

21.77 €

The Sublime Object of Ideology Slavoj Zizek

Mehka

15.89 €

Inner Experience Georges Bataille

Mehka

39.79 €

Collected Poems Philip Larkin

Mehka

14.88 €

Awaiting Oblivion Maurice Blanchot

Mehka

31.29 €

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.