2000 character limit reached
Towards the Integration of an Intuitionistic First-Order Prover into Coq (1606.05948v1)
Published 20 Jun 2016 in cs.LO
Abstract: An efficient intuitionistic first-order prover integrated into Coq is useful to replay proofs found by external automated theorem provers. We propose a two-phase approach: An intuitionistic prover generates a certificate based on the matrix characterization of intuitionistic first-order logic; the certificate is then translated into a sequent-style proof.