/ Jacob T. Schwartz, Domenico Cantone, Eugenio G. Omodeo
.PUBLICATION, DISTRIBUTION, ETC
Place of Publication, Distribution, etc.
London ;New York
Name of Publisher, Distributor, etc.
: Springer,
Date of Publication, Distribution, etc.
, c2011.
PHYSICAL DESCRIPTION
Specific Material Designation and Extent of Item
xvii, 416 p. , 24 cm.
NOTES PERTAINING TO PUBLICATION, DISTRIBUTION, ETC.
Text of Note
Electronic
INTERNAL BIBLIOGRAPHIES/INDEXES NOTE
Text of Note
Includes bibliographical references and index.
CONTENTS NOTE
Text of Note
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 -- A self-contained beginning for Ref's main proof scenario.
Text of Note
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 NtnaNova 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 NtnaNova 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.