The following pages link to (Q4520768):
Displaying 15 items.
- Incremental variable splitting (Q429591) (← links)
- Hypothesis finding with proof theoretical appropriateness criteria (Q817840) (← links)
- Innovations in computational type theory using Nuprl (Q865639) (← links)
- IeanCOP: lean connection-based theorem proving (Q1404981) (← links)
- The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics (Q2142078) (← links)
- Proof-search and proof nets in mixed linear logic (Q2703720) (← links)
- Proof reconstruction in classical and nonclassical logics (Diss., TU Darmstadt, 1999) (Q2726302) (← links)
- nanoCoP: A Non-clausal Connection Prover (Q2817929) (← links)
- A Non-clausal Connection Calculus (Q3010371) (← links)
- Specifying and Verifying Organizational Security Properties in First-Order Logic (Q3058451) (← links)
- leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions) (Q3541708) (← links)
- (Q4539627) (← links)
- Practical Proof Search for Coq by Type Inhabitation (Q5048991) (← links)
- (Q5413349) (← links)
- Connection calculus theorem proving with multiple built-in theories (Q5927987) (← links)