Envío gratis a partir de 69,99 euros.

«Comprobar estado del pedido»

Entre a formar parte de una comunidad de amantes de los libros del mundo entero y acceda a un sinfín de ventajas. Crear una cuenta gratis

Envío gratuito con Zásilkovna para compras superiores a 59.99 €

Mensajería SEUR 4.99 € Mensajería GLS 7.99 € Mensajería Correos 5.49 € Mensajería DHL 5.49 € Punto SEUR 3.99 €

Contacto

Cómo comprar

Ayuda

Mi cuenta

▸ Vacío :-(

Envío gratis a partir de 69,99 euros.

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

Idioma

Inglés

Libro Tapa blanda

Código Libristo: 04399100

Editores Cambridge University Press, septiembre 2007

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

Código Libristo: 04399100

114 b

46.69 €

Almacenamiento externo Envío en 9-15 días

Política de devolución de 30 días

Clientes que también han comprado

Proofs and Refutations Imre Lakatos

Tapa blanda

23.49 €

Models Mark Manson

Tapa blanda

13.49 €

Thinking about Mathematics Stewart Shapiro

Tapa blanda

53.89 €

Lying Sam Harris

Tapa dura

15.59 €

Friendly Introduction to Mathematical Logic Christopher C Leary

Tapa blanda

34.29 €

Molloy, Malone Dies, the Unnamable Samuel Beckett

Tapa dura

24.29 €

The Sublime Object of Ideology Slavoj Zizek

Tapa blanda

18.79 €

Inner Experience Georges Bataille

Tapa blanda

43.99 €

Collected Poems Philip Larkin

Tapa blanda

16.59 €

Awaiting Oblivion Maurice Blanchot

Tapa blanda

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.