Recommendations
Cited in
(20)- Trees and diagrams of decomposition
- From syntactic theories to interpreters: Automating the proof of unique decomposition
- The problem of \(\Pi_{2}\)-cut-introduction
- On the compressibility of finite languages and formal proofs
- Herbrand's theorem as higher order recursion
- On the cover complexity of finite languages
- Inductive theorem proving based on tree grammars
- scientific article; zbMATH DE number 5000964 (Why is no real title available?)
- scientific article; zbMATH DE number 7447752 (Why is no real title available?)
- Algorithmic introduction of quantified cuts
- scientific article; zbMATH DE number 2019855 (Why is no real title available?)
- scientific article; zbMATH DE number 809162 (Why is no real title available?)
- Manipulating tree tuple languages by transforming logic programs
- scientific article; zbMATH DE number 1406240 (Why is no real title available?)
- On the Herbrand content of LK
- Herbrand disjunctions, cut elimination and context-free tree grammars
- Tree grammars for the elimination of non-prenex cuts
- Compressibility of Finite Languages by Grammars
- Herbrand schemes for first-order logic
- Axiomatising tree-interpretable structures
This page was built for publication: Applying tree languages in proof theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890201)
