Pages that link to "Item:Q2891453"
From MaRDI portal
The following pages link to Towards Algorithmic Cut-Introduction (Q2891453):
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)
- On the cover complexity of finite languages (Q2334605) (← links)
- Inductive theorem proving based on tree grammars (Q2344621) (← links)
- Proof mining with dependent types (Q2364689) (← links)
- On the generation of quantified lemmas (Q2417949) (← links)
- System Description: GAPT 2.0 (Q2817928) (← links)
- Implementation and Evaluation of Contextual Natural Deduction for Minimal Logic (Q3179185) (← links)
- (Q3384900) (← links)
- Contextual Natural Deduction (Q3455860) (← links)
- (Q4357799) (← links)
- On the Herbrand content of LK (Q5015361) (← links)
- Compressibility of Finite Languages by Grammars (Q5500684) (← links)
- Analogy in Automated Deduction: A Survey (Q5739522) (← links)
- Lemmas: generation, selection, application (Q6541149) (← links)