Cantitate/Preț
Produs

Logic of Computation: NATO ASI Series / Computer and Systems Sciences, cartea 157

Helmut Schwichtenberg
en Limba Engleză Hardback – 16 iul 1997
The latest work by the world's leading authorities on the use of formal methods in computer science is presented in this volume, based on the 1995 International Summer School in Marktoberdorf, Germany. Logic is of special importance in computer science, since it provides the basis for giving correct semantics of programs, for specification and verification of software, and for program synthesis. The lectures presented here provide the basic knowledge a researcher in this area should have and give excellent starting points for exploring the literature. Topics covered include semantics and category theory, machine based theorem proving, logic programming, bounded arithmetic, proof theory, algebraic specifications and rewriting, algebraic algorithms, and type theory.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 33155 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 13 oct 2012 33155 lei  6-8 săpt.
Hardback (1) 57867 lei  6-8 săpt.
  Springer Verlag – 16 iul 1997 57867 lei  6-8 săpt.

Preț: 57867 lei

Preț vechi: 68079 lei
-15% Nou

Puncte Express: 868

Preț estimativ în valută:
11078 11515$ 9185£

Carte tipărită la comandă

Livrare economică 06-20 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540629634
ISBN-10: 3540629637
Pagini: 394
Dimensiuni: 155 x 235 mm
Greutate: 0.76 kg
Editura: Springer Verlag
Colecția Springer
Seriile NATO ASI Series / Computer and Systems Sciences, Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Descriere

The latest work on formal methods in computer science by the world's leading experts is presented in this volume, based on the 1995 International Marktoberdorf Summer School.

Cuprins

Lectures on Semantics: The Initial Algebra and Final Coalgebra Perspectives.- to Gröbner Bases.- Bounded Arithmetic and Propositional Proof Complexity.- The Structure of Nuprl’s Type Theory.- Axiomatisations, Proofs, and Formal Specifications of Algorithms: Commented Case Studies in the Coq Proof Assistant.- Some Proof Theory of First Order Logic Programming.- Timed Rewriting Logic for the Specification of Time-Sensitive Systems.- Logic Programming and Meta-Logic.- Proofs, Lambda Terms and Control Operators.- Basic Proof Theory with Applications to Computation.