swMATH ID: 9757
Software Authors: Otten, Jens
Description: Clausal connection-based theorem proving in intuitionistic first-order logic. 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 Emphasis ileanCoP, and experimental results.
Homepage: http://www.leancop.de/ileancop/index.html
Related Software: leanCoP; TPTP; FEMaLeCoP; E Theorem Prover; VAMPIRE; ILTP; MaLeCoP; MleanCoP; MPTP 0.2; JProver; Coq; nanoCoP; Satallax; MaLARea; Mizar; Flyspeck; leanTAP; SETHEO; QMLTP; HOList
Cited in: 31 Publications

Citations by Year