University of Cambridge > > Isaac Newton Institute Seminar Series > Mining Human Proofs from Machine Proofs

Mining Human Proofs from Machine Proofs

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact INI IT.

BPR - Big proof

When recently investigating an intuitionistic fragment of Lukasiewicz logic [1-4], we were able to discover several interesting theorems of this logic by searching for valid equations in the algebra of hoops. Our search for valid equations or counter-models was done using prover9 and mace4 ( In this talk I will describe some of the results obtained, mainly around double negation translations of the classical logic into the intuitionistic counter-part, but also the process by which we managed to translate prover9 equational proofs into human readable (and hopefully understandable) proofs.Joint work with Rob Arthan.[1] R Arthan and P Oliva, Negative translations for affine and Lukasiewicz logic, under review ([2] R Arthan and P Oliva, On pocrims and hoops, Arxiv ([3] R Arthan and P Oliva, On affine logic and Lukasiewicz logic, Arxiv ([4] R Arthan and P Oliva, Dual hoops have unique halving, McCune Festschrift, LNAI 7788 , pp. 165-180, 2013

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2022, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity