9780521877527 - Computability and Logic de Boolos, George S.; Burgess, John P.; Jeffrey, Richard C. (21 résultats)

Etat : New. In.

Etat : As New. Unread book in perfect condition.

Etat : New.

Etat : New.

Etat : New.

Etat : New. Computability and Logic is a classic because of its accessibility to students without a mathematical background. This fifth edition was first published in 2007. Num Pages: 366 pages, black & white illustrations, figures. BIC Classification: HPL; PBCD. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 21. Weight in Grams: 798. . 2007. 5th Edition. hardcover. . . . .

Etat : As New. Unread book in perfect condition.

Hardback. Etat : New. 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.

Etat : New. Computability and Logic is a classic because of its accessibility to students without a mathematical background. This fifth edition was first published in 2007. Num Pages: 366 pages, black & white illustrations, figures. BIC Classification: HPL; PBCD. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 21. Weight in Grams: 798. . 2007. 5th Edition. hardcover. . . . . Books ship from the US and Ireland.

Hardback. Etat : New. 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.

Buch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Hardcover. Etat : new. Hardcover. 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. 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, but also a large number of optional topics, from Turing's theory of computability to Ramsey's theorem. This fifth edition was first published in 2007. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Hardcover. Etat : Brand New. 5th edition. 350 pages. 10.25x7.25x1.00 inches. In Stock. This item is printed on demand.

Etat : New. Print on Demand pp. 366 68:B&W 7 x 10 in or 254 x 178 mm Case Laminate on White w/Gloss Lam.

Etat : New. Print on Demand pp. 366 5th Edition.

Hardback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

Etat : New. PRINT ON DEMAND pp. 366.

Hardcover. Etat : new. Hardcover. 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. 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, but also a large number of optional topics, from Turing's theory of computability to Ramsey's theorem. This fifth edition was first published in 2007. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Hardcover. Etat : new. Hardcover. 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. 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, but also a large number of optional topics, from Turing's theory of computability to Ramsey's theorem. This fifth edition was first published in 2007. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Gebunden. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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, but also a large number of optional topics, from Turi.

Buch. Etat : Neu. Computability and Logic | George S. Boolos (u. a.) | Buch | Gebunden | Englisch | 2012 | Cambridge University Press | EAN 9780521877527 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.