Applying Tree Languages in Proof Theory
From MaRDI portal
Publication:2890201
DOI10.1007/978-3-642-28332-1_26zbMath1350.68170OpenAlexW2204729546MaRDI QIDQ2890201
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
Formal languages and automata (68Q45) Proof theory in general (including proof-theoretic semantics) (03F03)
Related Items (9)
The problem of \(\Pi_{2}\)-cut-introduction ⋮ On the Herbrand content of LK ⋮ Algorithmic introduction of quantified cuts ⋮ On the compressibility of finite languages and formal proofs ⋮ Unnamed Item ⋮ Herbrand's theorem as higher order recursion ⋮ Compressibility of Finite Languages by Grammars ⋮ On the cover complexity of finite languages ⋮ Inductive theorem proving based on tree grammars
This page was built for publication: Applying Tree Languages in Proof Theory
