Domenico Cantone – författare

Set Theory for Computing offers an up-to-date and comprehensive account of set-oriented symbolic manipulation and automated reasoning methods. Mastering today's variety of systems with crisp, formal tools is a prerequisite for a high degree of control over sets and aggregates. The many algorithmic methods and deductive techniques in this book offer readers a clear view of the use of set-theoretic notions in such critical areas as specification of problems, data types, and solution methods; algorithmic program verification; and automated deduction.The rigorous and largely self-contained style of presentation addresses readers wanting to complement their set intuition with the ability to exploit it in specification and verification and master it by symbolic, logically based techniques and methods. This book will be of interest to graduates and researchers in theoretical computer science and computational logic and automated reasoning.

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.

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.

Set Theory for Computing offers an up-to-date and comprehensive account of set-oriented symbolic manipulation and automated reasoning methods. Mastering today's variety of systems with crisp, formal tools is a prerequisite for a high degree of control over sets and aggregates. The many algorithmic methods and deductive techniques in this book offer readers a clear view of the use of set-theoretic notions in such critical areas as specification of problems, data types, and solution methods; algorithmic program verification; and automated deduction.The rigorous and largely self-contained style of presentation addresses readers wanting to complement their set intuition with the ability to exploit it in specification and verification and master it by symbolic, logically based techniques and methods. This book will be of interest to graduates and researchers in theoretical computer science and computational logic and automated reasoning.

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.

Set Theory for Computing offers an up-to-date and comprehensive account of set-oriented symbolic manipulation and automated reasoning methods. Mastering today''s variety of systems with crisp, formal tools is a prerequisite for a high degree of control over sets and aggregates. The many algorithmic methods and deductive techniques in this book offer readers a clear view of the use of set-theoretic notions in such critical areas as specification of problems, data types, and solution methods; algorithmic program verification; and automated deduction.The rigorous and largely self-contained style of presentation addresses readers wanting to complement their set intuition with the ability to exploit it in specification and verification and master it by symbolic, logically based techniques and methods. This book will be of interest to graduates and researchers in theoretical computer science and computational logic and automated reasoning.

Alfredo Ferro’s impact on information technology has traversed diverse domains, encompassing Computational Logic, Data Mining, Bioinformatics, and Complex Systems. After first studying Mathematics at the University of Catania, he received a Ph.D. in Computer Science from NYU in 1981, working under the supervision of Jacob Theodor (Jack) Schwartz. He returned to the University of Catania where he established the Computer Science undergraduate program, served as the coordinator of the Ph.D. program in Computer Science, cofounded the Ph.D. program in Biology, Human Genetics, and Bioinformatics, and retired as a full professor in 2021.Alfredo’s academic career as a computer scientist is characterized by two distinct research phases: Computational Logic until approximately 1995, followed by a notable focus on Data Mining and Bioinformatics. The contributions in this volume reflect the quality and the scope of his personal and collaborative successes.He also taught andinspired many excellent scientists. A pioneering initiative was to establish summer schools for Ph.D. students in 1989, leading to the so-called Lipari School, now the J.T. Schwartz International School for Scientific Research, where Alfredo continues to serve as director. This prestigious series includes schools focused on Computer Science, Complex Systems, and Computational Biology, featuring world-class scientists as lecturers and mentors.

Alfredo Ferro’s impact on information technology has traversed diverse domains, encompassing Computational Logic, Data Mining, Bioinformatics, and Complex Systems. After first studying Mathematics at the University of Catania, he received a Ph.D. in Computer Science from NYU in 1981, working under the supervision of Jacob Theodor (Jack) Schwartz. He returned to the University of Catania where he established the Computer Science undergraduate program, served as the coordinator of the Ph.D. program in Computer Science, cofounded the Ph.D. program in Biology, Human Genetics, and Bioinformatics, and retired as a full professor in 2021.Alfredo’s academic career as a computer scientist is characterized by two distinct research phases: Computational Logic until approximately 1995, followed by a notable focus on Data Mining and Bioinformatics. The contributions in this volume reflect the quality and the scope of his personal and collaborative successes.

He also taught andinspired many excellent scientists. A pioneering initiative was to establish summer schools for Ph.D. students in 1989, leading to the so-called Lipari School, now the J.T. Schwartz International School for Scientific Research, where Alfredo continues to serve as director. This prestigious series includes schools focused on Computer Science, Complex Systems, and Computational Biology, featuring world-class scientists as lecturers and mentors.

This book presents an intuitive picture-oriented approach to the formative processes technique and to its applications. In the first part the authors introduce basic set-theoretic terminology and properties, the decision problem in set theory, and formative processes. The second part of the book is devoted to applications of the technique of formative processes to decision problems.All chapters contain exercises and the book is appropriate for researchers and graduate students in the area of computer science logic.