Pages that link to "Item:Q402115"
From MaRDI portal
The following pages link to Algorithmic introduction of quantified cuts (Q402115):
Displaying 17 items.
- Algorithmic introduction of quantified cuts (Q402115) (← links)
- The problem of \(\Pi_{2}\)-cut-introduction (Q1680562) (← links)
- On the compressibility of finite languages and formal proofs (Q1706152) (← links)
- Herbrand's theorem as higher order recursion (Q1987218) (← links)
- Learning from Łukasiewicz and Meredith: investigations into proof structures (Q2055843) (← links)
- On the cover complexity of finite languages (Q2334605) (← links)
- Inductive theorem proving based on tree grammars (Q2344621) (← links)
- On the generation of quantified lemmas (Q2417949) (← links)
- System Description: GAPT 2.0 (Q2817928) (← links)
- Towards Algorithmic Cut-Introduction (Q2891453) (← links)
- (Q3384900) (← links)
- Towards the Compression of First-Order Resolution Proofs by Lowering Unit Clauses (Q3454106) (← links)
- (Q4362908) (← links)
- On the Herbrand content of LK (Q5015361) (← links)
- Higher-order pattern generalization modulo equational theories (Q5139277) (← links)
- Complexity of translations from resolution to sequent calculus (Q5236549) (← links)
- Compressibility of Finite Languages by Grammars (Q5500684) (← links)
