Cantitate/Preț
Produs

Computational Logic: NATO ASI Subseries F:, cartea 165

Editat de Ulrich Berger, Helmut Schwichtenberg
en Limba Engleză Paperback – 29 oct 2012
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).
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 97831 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 29 oct 2012 97831 lei  6-8 săpt.
Hardback (1) 98459 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 14 apr 1999 98459 lei  6-8 săpt.

Din seria NATO ASI Subseries F:

Preț: 97831 lei

Preț vechi: 122288 lei
-20% Nou

Puncte Express: 1467

Preț estimativ în valută:
18729 19468$ 15528£

Carte tipărită la comandă

Livrare economică 07-21 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642636707
ISBN-10: 3642636705
Pagini: 460
Ilustrații: IX, 448 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.64 kg
Ediția:Softcover reprint of the original 1st ed. 1999
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria NATO ASI Subseries F:

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Game Semantics.- Notes on the Simply Typed Lambda Calculus.- Problems in Type Theory.- Formal Correctness Proofs of Functional Programs: Dijkstra’s Algorithm, a Case Study.- Propositional Proof Complexity – An Introduction.- Formalizing Decidability Theorems About Automata.- On the Meaning of Logical Rules I: Syntax Versus Semantics.- Complexity of Primitive Recursion.- Computers, Reasoning and Mathematical Practice.- Research Directions in Rewriting Logic.- Sequent Calculus and the Specification of Computation.

Caracteristici

World-class research on the interplay of mathematical logic and computer science High-level introduction to proof-theoretic and semantic foundations of programming concepts The latest in a renowned series of Marktoberdorf Summer School volumes on computational logic