Anbieter: Anybook.com, Lincoln, Vereinigtes Königreich
EUR 24,47
Anzahl: 1 verfügbar
In den WarenkorbZustand: Fair. Volume 165. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In fair condition, suitable as a study copy. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,800grams, ISBN:9783540645894.
EUR 42,71
Anzahl: 1 verfügbar
In den WarenkorbZustand: New. pp. 460 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
Anbieter: Wissenschaftl. Antiquariat Th. Haker e.K, Klettgau, Deutschland
Zustand: Sehr gut. orig. ed. 457 p. In very good condition. ISBN: 9783540645894 Sprache: Englisch Gewicht in Gramm: 788 15,6 x 2,5 x 23,4 cm, hardcover.
Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
Zustand: Used. pp. 460.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 162,50
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Sprache: Englisch
Verlag: Springer Berlin Heidelberg, Springer Berlin Heidelberg, 1999
ISBN 10: 3540645896 ISBN 13: 9783540645894
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Recent developments in computer science clearly show the need for a better theoretical foundation for some central issues. Methods and results from mathematical logic, in particular proof theory and model theory, are of great help here and will be used much more in future than previously. This book provides an excellent introduction to the interplay of mathematical logic and computer science. It contains extensively reworked versions of the lectures given at the 1997 Marktoberdorf Summer School by leading researchers in the field.Topics covered include: proof theory and specification of computation (J.-Y. Girard, D. Miller), complexity of proofs and programs (S. R. Buss, S. S. Wainer), computational content of proofs (H. Schwichtenberg), constructive type theory (P. Aczel, H. Barendregt, R. L. Constable), computational mathematics, (U. Martin), rewriting logic (J. Meseguer), and game semantics (S. Abramski).