The following pages link to GAPT (Q33995):
Displayed 9 items.
- Extraction of expansion trees (Q670704) (← links)
- The problem of \(\Pi_{2}\)-cut-introduction (Q1680562) (← links)
- The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics (Q2142078) (← links)
- Certification of nonclausal connection tableaux proofs (Q2180504) (← links)
- Herbrand constructivization for automated intuitionistic theorem proving (Q2180528) (← links)
- On the generation of quantified lemmas (Q2417949) (← links)
- Understanding Resolution Proofs through Herbrand’s Theorem (Q2851942) (← links)
- Complexity of translations from resolution to sequent calculus (Q5236549) (← links)
- Scalable fine-grained proofs for formula processing (Q5919479) (← links)