
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
This volume describes computational techniques for deciding formulae in set theory. It includes information on a series of investigations in elementary set theory, aiming to automate simple proofs over a wide range of mathematical areas. Full coverage of such fundamentals as classes and orderings, the validity problem, elementary syllogistics, and restricted quantifiers is provided, as well as more advanced material on the powerset operator, MAP constructs, the unionset operator, and the choice operator.
This volume investigates the computational methods required to automate decision procedures for formulae within set theory. The authors, Alfredo Ferro, Domenico Cantone, and Eugenio Omodeo, draw upon their expertise in formal logic and computer science to present a rigorous framework for automating mathematical proofs. By focusing on the intersection of set theory and algorithmic verification, the text provides a systematic approach to handling complex logical structures through computational means.
What You Will Find
Experts recognize this work as a foundational text for researchers interested in the automation of mathematical reasoning. Readers frequently note the technical density of the prose, which requires a strong background in formal logic to fully grasp the presented algorithms.
Page Count:
360
Publication Date:
1990-04-12
Publisher:
Oxford University Press
ISBN-10:
0198538073
ISBN-13:
9780198538073
No comments yet. Be the first to share your thoughts!