Pages that link to "Item:Q2890201"
From MaRDI portal
The following pages link to Applying Tree Languages in Proof Theory (Q2890201):
Displaying 9 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)
- (Q3384900) (← links)
- On the Herbrand content of LK (Q5015361) (← links)
- Compressibility of Finite Languages by Grammars (Q5500684) (← links)
