Automated ZFC Theorem Proving with E

02/03/2019

∙

I introduce an approach for automated reasoning in first order set theories that are not finitely axiomatizable, such as ZFC, and describe its implementation alongside the automated theorem proving software E. I then compare the results of proof search in the class based set theory NBG with those of ZFC.

READ FULL TEXT

Automated ZFC Theorem Proving with E

Automated theorem proving in first-order logic modulo: on the difference between type theory and set theory

Proof Simplification and Automated Theorem Proving

Evidence Algorithm and System for Automated Deduction: A Retrospective View

Comparison of Two Theorem Provers: Isabelle/HOL and Coq

Pecan: An Automated Theorem Prover for Automatic Sequences using Büchi Automata

Generating Compressed Combinatory Proof Structures – An Approach to Automated First-Order Theorem Proving

Integrating an Automated Prover for Projective Geometry as a New Tactic in the Coq Proof Assistant

Automated ZFC Theorem Proving with E

Related Research

Automated theorem proving in first-order logic modulo: on the difference between type theory and set theory

Proof Simplification and Automated Theorem Proving

Evidence Algorithm and System for Automated Deduction: A Retrospective View

Comparison of Two Theorem Provers: Isabelle/HOL and Coq

Pecan: An Automated Theorem Prover for Automatic Sequences using Büchi Automata

Generating Compressed Combinatory Proof Structures – An Approach to Automated First-Order Theorem Proving

Integrating an Automated Prover for Projective Geometry as a New Tactic in the Coq Proof Assistant