Applying tree languages in proof theory

DOI10.1007/978-3-642-28332-1_26zbMATH Open1350.68170OpenAlexW2204729546MaRDI QIDQ2890201FDOQ2890201

Authors: Stefan Hetzl 

Publication date: 8 June 2012

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28332-1_26

Recommendations

• Tree grammars for the elimination of non-prenex cuts
• Herbrand disjunctions, cut elimination and context-free tree grammars
• scientific article; zbMATH DE number 2019855
• scientific article; zbMATH DE number 5000964
• scientific article; zbMATH DE number 1689588

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Proof theory in general (including proof-theoretic semantics) (03F03)

Cited In (19)

• Title not available (Why is that?)
• Herbrand's theorem as higher order recursion
• On the cover complexity of finite languages
• Algorithmic introduction of quantified cuts
• From syntactic theories to interpreters: Automating the proof of unique decomposition
• Tree grammars for the elimination of non-prenex cuts
• On the Herbrand content of LK
• Axiomatising tree-interpretable structures
• Title not available (Why is that?)
• Title not available (Why is that?)
• Manipulating tree tuple languages by transforming logic programs
• Compressibility of Finite Languages by Grammars
• The problem of \(\Pi_{2}\)-cut-introduction
• Herbrand disjunctions, cut elimination and context-free tree grammars
• Title not available (Why is that?)
• Trees and diagrams of decomposition
• On the compressibility of finite languages and formal proofs
• Title not available (Why is that?)
• Inductive theorem proving based on tree grammars

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)