Cited in
(20)- Theorem prover for intuitionistic logic based on the inverse method
- Certification of nonclausal connection tableaux proofs
- Building reliable, high-performance networks with the Nuprl proof development system
- A matrix characterization for multiplicative exponential linear logic
- leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions)
- Automated Reasoning with Analytic Tableaux and Related Methods
- The ILTP problem library for intuitionistic logic
- Automated reasoning. 1st international joint conference, IJCAR 2001, Siena, Italy, June 18-22, 2001. Proceedings
- Hilberticus
- MetaPRL
- STRIP
- ileanCoP
- MODPROF
- Horus
- WhaleProver
- Innovations in computational type theory using Nuprl
- Practical Proof Search for Coq by Type Inhabitation
- A Non-clausal Connection Calculus
- Hammer for Coq: automation for dependent type theory
- nanoCoP: a non-clausal connection prover
This page was built for software: JProver
