A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf
.
Clausal Connection-Based Theorem Proving in Intuitionistic First-Order Logic
[chapter]
2005
Lecture Notes in Computer Science
We present a clausal connection calculus for first-order intuitionistic logic. It extends the classical connection calculus by adding prefixes that encode the characteristics of intuitionistic logic. Our calculus is based on a clausal matrix characterisation for intuitionistic logic, which we prove correct and complete. The calculus was implemented by extending the classical prover leanCoP. We present some details of the implementation, called ileanCoP, and experimental results.
doi:10.1007/11554554_19
fatcat:aacmbps255d7jo62s53bugoaxe