Computational Logic and Set Theory: Applying Formalized Logic to Analysis

Authors:
Jacob T. Schwartz;Domenico Cantone;Eugenio G. Omodeo
Affiliations:
-;-;-
Venue:
Computational Logic and Set Theory: Applying Formalized Logic to Analysis
Year:
2011

Citing 0
Cited 3

Set graphs. I. Hereditarily finite sets and extensional acyclic orientations

Discrete Applied Mathematics
Ranking, unranking and random generation of extensional acyclic digraphs

Information Processing Letters
Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 a 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.