Sprache: Englisch
Verlag: Cambridge University Press, 2010
ISBN 10: 0521168465 ISBN 13: 9780521168465
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 66,69
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Sprache: Englisch
Verlag: Cambridge University Press, 2010
ISBN 10: 0521168465 ISBN 13: 9780521168465
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: New. This two-volume set bridges the gap between introductory texts and the research literature. Series: Cambridge Studies in Advanced Mathematics. Num Pages: 342 pages, black & white illustrations. BIC Classification: PBCD; PBCH. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 229 x 152 x 19. Weight in Grams: 500. . 2006. paperback. . . . . Books ship from the US and Ireland.
Sprache: Englisch
Verlag: Cambridge University Press, 2010
ISBN 10: 0521168465 ISBN 13: 9780521168465
Anbieter: moluna, Greven, Deutschland
EUR 71,06
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. This work includes formal proof techniques, a section on applications of compactness, a generous dose of computability and its relation to the incompleteness phenomenon, and the first presentation of a complete proof of Godel s 2nd incompleteness since Hilb.
Sprache: Englisch
Verlag: Cambridge University Press, 2010
ISBN 10: 0521168465 ISBN 13: 9780521168465
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This two-volume work bridges the gap between introductory expositions of logic or set theory on one hand, and the research literature on the other. It can be used as a text in an advanced undergraduate or beginning graduate course in mathematics, computer science, or philosophy. The volumes are written in a user-friendly conversational lecture style that makes them equally effective for self-study or class use. Volume 1 includes formal proof techniques, a section on applications of compactness (including nonstandard analysis), a generous dose of computability and its relation to the incompleteness phenomenon, and the first presentation of a complete proof of Godel's 2nd incompleteness since Hilbert and Bernay's Grundlagen theorem.