Abstract
We introduce a new connection between formal language theory and proof theory. One of the most fundamental proof transformations in a class of formal proofs is shown to correspond exactly to the computation of the language of a certain class of tree grammars. Translations in both directions, from proofs to grammars and from grammars to proofs, are provided. This correspondence allows theoretical as well as practical applications. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Hetzl, S. (2012). Applying tree languages in proof theory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7183 LNCS, pp. 301–312). https://doi.org/10.1007/978-3-642-28332-1_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
