Cantitate/Preț
Produs

Computational Logic and Set Theory: Applying Formalized Logic to Analysis

Autor Jacob T. Schwartz, Domenico Cantone, Eugenio G. Omodeo Cuvânt înainte de Martin Davis
en Limba Engleză Paperback – 6 sep 2014
This must-read text presents the pioneering work of the late Professor Jacob (Jack) T. Schwartz on computational logic and set theory and its application to proof verification techniques, culminating in the ÆtnaNova system, a prototype computer program designed to verify the correctness of mathematical proofs presented in the language of set theory. Topics and features: describes in depth how a specific first-order theory can be exploited to model and carry out reasoning in branches of computer science and mathematics; presents an unique system for automated proof verification in large-scale software systems; integrates important proof-engineering issues, reflecting the goals of large-scale verifiers; includes an appendix showing formalized proofs of ordinals, of various properties of the transitive closure operation, of finite and transfinite induction principles, and of Zorn’s lemma.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 33365 lei  6-8 săpt.
  SPRINGER LONDON – 6 sep 2014 33365 lei  6-8 săpt.
Hardback (1) 33948 lei  6-8 săpt.
  SPRINGER LONDON – 16 iul 2011 33948 lei  6-8 săpt.

Preț: 33365 lei

Preț vechi: 41706 lei
-20% Nou

Puncte Express: 500

Preț estimativ în valută:
6387 6569$ 5299£

Carte tipărită la comandă

Livrare economică 19 februarie-05 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781447160182
ISBN-10: 1447160185
Pagini: 436
Ilustrații: XVII, 416 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.61 kg
Ediția:2011
Editura: SPRINGER LONDON
Colecția Springer
Locul publicării:London, United Kingdom

Public țintă

Graduate

Cuprins

Introduction.- Propositional and Predicate-Calculus Preliminaries.- A Survey of Inference Mechanisms.- More on the Structure of the Verifier System.- A Closer Examination of the Sequence of Definitions and Theorems Presented in this Book.- Undecidability and Unsolvability.

Recenzii

From the book reviews:
“This is a text defining new formulae, theorems, lemmas, and sublanguages. Partition calculus and subset theory is well developed. … I recommend this book to all students and logicians.” (Joseph J. Grenier, Amazon.com, August, 2014)
“The contents of the book makes it inspiring and interesting both to mathematicians and to computer scientists. … This is one of a few recent books which promise to both make mathematicians aware of the possibilities opened by the recent progress in automated theorem proving and draw the attention of the researchers working in logic and automated theorem proving to the challenges and possibilities raised by interesting problems in mathematics.” (Viorica Sofronie-Stokkermans, Zentralblatt MATH, Vol. 1246, 2012)

Textul de pe ultima copertă

As computer software becomes more complex, the question of how its correctness can be assured grows ever more critical. Formal logic embodied in computer programs is an important part of the answer to this problem.
This must-read text presents the pioneering work of the late Professor Jacob (Jack) T. Schwartz on computational logic and set theory and its application to proof verification techniques, culminating in the ÆtnaNova system, a prototype computer program designed to verify the correctness of mathematical proofs presented in the language of set theory. Taking a systematic approach, the book begins with a survey of traditional branches of logic before describing in detail the underlying design of the ÆtnaNova system. Major classical results on undecidability and unsolvability are then recast for this system. Readers do not require great knowledge of formal logic in order to follow the text, but a good understanding of standard programming techniques, and a familiarity with mathematical definitions and proofs reflecting the usual levels of rigor is assumed.
Topics and features:
  • With a Foreword by Dr. Martin Davis, Professor Emeritus of the Courant Institute of Mathematical Sciences, New York University
  • Describes in depth how a specific first-order theory can be exploited to model and carry out reasoning in branches of computer science and mathematics
  • Presents an unique system for automated proof verification on the large scale
  • Integrates important proof-engineering issues, reflecting the goals of large-scale verifiers
  • Includes an appendix showing formalized proofs of ordinals, of various properties of the transitive closure operation, of finite and transfinite induction principles, and of Zorn’s lemma
This ground-breaking work is essential reading for researchers and advanced graduates of computer science.

Caracteristici

Presents the pioneering work of the late Professor Jacob (Jack) T. Schwartz Introduces an unique system for automated proof verification in large-scale software systems With a Foreword by Prof. Martin Davis of the Courant Institute of Mathematical Sciences, New York University Includes supplementary material: sn.pub/extras
 
We have cookies