Jacob T. Schwartz, Domenico Cantone, Eugenio G. Omodeo
مشخصات ظاهری
نام خاص و کميت اثر
1 online resource (xvii, 416 pages)
یادداشتهای مربوط به کتابنامه ، واژه نامه و نمایه های داخل اثر
متن يادداشت
Includes bibliographical references and index
یادداشتهای مربوط به مندرجات
متن يادداشت
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
بدون عنوان
0
یادداشتهای مربوط به خلاصه یا چکیده
متن يادداشت
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
ویراست دیگر از اثر در قالب دیگر رسانه
عنوان
Computational logic and set theory.
موضوع (اسم عام یاعبارت اسمی عام)
موضوع مستند نشده
Set theory
رده بندی ديویی
شماره
511
.
322
ويراست
23
رده بندی کنگره
شماره رده
QA248
نشانه اثر
.
S39
2011eb
نام شخص به منزله سر شناسه - (مسئولیت معنوی درجه اول )