Abstract

In this paper, we present the Theorema Set Theory Prover. This prover is designed for proving statements involving notions from set theory using natural deduction inference rules for set theory. Moreover, it applies the PCS paradigm (Proving-Computing-Solving) for generating natural proofs that has already been used in other provers in the Theorema system, notably the prover for automated proofs in elementary analysis. We show some applications of this prover in a case study on equivalence relations and partitions, which also nicely shows the interplay between proving, computing, and solving during an exploration of some mathematical theory.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.