Vérifier l’état de la commande

Accédez à une communauté d'amateurs de livres à travers le monde et bénéficiez d’une panoplie d'avantages. Créer un compte gratuitement

La Poste Autrichienne 5.49 € Service de messagerie GLS 4.99 € Coursier DPD 4.49 € Point DPD 3.49 €

Contact

Comment faire ses achats

Assistance

Mon compte

▸ Vide :-(

Computability and Logic

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

George S Boolos

Langue

Anglais

Livre Livre de poche

Code Libristo: 04399100

Éditeurs Cambridge University Press, septembre 2007

Computability and Logic has become a classic because of its accessibility to students without a math... Description détaillée

Code Libristo: 04399100

94 b

38.39 € TVA incluse

Stockage externe Expédition sous 14-21 jours

Livraison à Autriche

Jusqu'à 30 jours pour les retours

Les clients ont également acheté

Proofs and Refutations Imre Lakatos

Livre de poche

17.99 €

Friendly Introduction to Mathematical Logic Christopher C Leary

Livre de poche

27.99 €

Models Mark Manson

Livre de poche

10.89 €

Thinking about Mathematics Stewart Shapiro

Livre de poche

42.89 €

Collected Poems Philip Larkin

Livre de poche

12.69 €

The Sublime Object of Ideology Slavoj Zizek

Livre de poche

14.99 €

Awaiting Oblivion Maurice Blanchot

Livre de poche

27.99 €

Inner Experience Georges Bataille

Livre de poche

35.39 €

Molloy, Malone Dies, the Unnamable Samuel Beckett

Livre relié

18.59 €

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.