Cantitate/Preț
Produs
Total produse
Vezi coșul
Computability and Logic de George S. Boolos

Computability and Logic

Autor George S. Boolos, John P. Burgess, Richard C. Jeffrey
en Limba Engleză Hardback – 16 sep 2007
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 27852 lei  6-8 săpt.
  Cambridge University Press – 16 sep 2007 27852 lei  6-8 săpt.
Hardback (1) 70741 lei  6-8 săpt.
  Cambridge University Press – 16 sep 2007 70741 lei  6-8 săpt.

Preț: 70741 lei

Preț vechi: 82256 lei
-14% Nou

Puncte Express: 1061
Preț estimativ în valută:
13536€ • 14763$ • 11414£

Carte tipărită la comandă

Livrare economică 24 aprilie-08 mai

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780521877527
ISBN-10: 0521877520
Pagini: 366
Dimensiuni: 184 x 253 x 25 mm
Greutate: 0.79 kg
Ediția:5
Editura: Cambridge University Press
Colecția Cambridge University Press
Locul publicării:New York, United States

Cuprins

Part I. Computability Theory: 1. Enumerability; 2. Diagonalization; 3. Turing computability; 4. Uncomputability; 5. Abacus computability; 6. Recursive functions; 7. Recursive sets and relations; 8. Equivalent definitions of computability; Part II. Basic Metalogic: 9. A precis of first-order logic: syntax; 10. A precis of first-order logic: semantics; 11. The undecidability of first-order logic; 12. Models; 13. The existence of models; 14. Proofs and completeness; 15. Arithmetization; 16. Representability of recursive functions; 17. Indefinability, undecidability, incompleteness; 18. The unprovability of consistency; Part III. Further Topics: 19. Normal forms; 20. The Craig interpolation theorem; 21. Monadic and dyadic logic; 22. Second-order logic; 23. Arithmetical definability; 24. Decidability of arithmetic without multiplication; 25. Non-standard models; 26. Ramsey's theorem; 27. Modal logic and provability.

Recenzii

'… gives an excellent coverage of the fundamental theoretical results about logic involving computability, undecidability, axiomatization, definability, incompleteness, etc.' American Math Monthly
'The writing style is excellent: Although many explanations are formal, they are perfectly clear. Modern, elegant proofs help the reader understand the classic theorems and keep the book to a reasonable length.' Computing Reviews
' … a valuable asset to those who want to enhance their knowledge and strengthen their ideas in the areas of artificial intelligence, philosophy, theory of computing, discrete structures, mathematical logic. It is also useful to teachers for improving their teaching style in these subjects.' Computer Engineering

Descriere

Computability and Logic is a classic because of its accessibility to students without a mathematical background. This fifth edition was first published in 2007.