Abstract: Deciding which sub-tool to use for a given proof state requires expertise specific to each interactive theorem prover (ITP). To mitigate this problem, we present PaMpeR, a proof method ...
We introduce a proof-theoretic method for showing nondefinability of second-order intuitionistic connectives by quantifier-free schemata. We apply the method to confirm that Taranovsky's ...
Abstract: In this paper we present an approach to automated learning within mathematical reasoning systems. In particular, the approach enables proof planning systems to automatically learn new proof ...
MIT Press recently published Fundamental Proof Methods in Computer Science, a book by Konstantine Arkoudas and David Musser, a professor emeritus of computer science at the Rensselaer Polytechnic ...
1 Institute of Mathematics Education and Computer Science Education, University of Münster, Münster, Germany 2 Mathematical Institute, University of Münster, Münster, Germany Background: Proofs are a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback