Spedizione gratuita per ordini superiori a 69,99 euro.

Controllare lo stato dell'ordine

Entra a far parte di una comunità di amanti dei libri di tutto il mondo e ottieni numerosi vantaggi. Crea un account gratuito

Spedizione gratuita con Packeta per un prezzo superiore a 69.99 €

Bartolini 4.49 € Punto Poste 5.49 € Punto Poste 5.49 € Punto Bartolini 3.49 € DHL 6.99 € GLS 7.99 €

Contatto

Come acquistare

Aiuto

Il mio account

▸ Vuoto :-(

Spedizione gratuita per ordini superiori a 69,99 euro.

Computability and Logic

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

George S Boolos

Lingua

Inglese

Libro In brossura

Codice Libristo: 04399100

Casa editrice Cambridge University Press, settembre 2007

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

Codice Libristo: 04399100

114 b

I migliori

46.69 €

Magazzino esterno Inviamo tra 9-15 giorni

30 giorni per il reso

I clienti hanno acquistato anche

Proofs and Refutations Imre Lakatos

In brossura

23.49 €

Models Mark Manson

In brossura

13.49 €

Thinking about Mathematics Stewart Shapiro

In brossura

52.99 €

Lying Sam Harris

Rigido

14.69 €

Friendly Introduction to Mathematical Logic Christopher C Leary

In brossura

34.29 €

Molloy, Malone Dies, the Unnamable Samuel Beckett

Rigido

24.29 €

The Sublime Object of Ideology Slavoj Zizek

In brossura

19.09 €

Inner Experience Georges Bataille

In brossura

43.19 €

Collected Poems Philip Larkin

In brossura

16.59 €

Awaiting Oblivion Maurice Blanchot

In brossura

33.69 €

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.