Lambek Calculus Proofs and Tree Automata

Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus cannot be accepted by a finite tree automaton. The proof is extended to cover the proofs used by grammars based on the Lambek calculus, which typically use only a subset of the set of all proofs. While Lambek grammars can assign regular tree languages as structural descriptions, there exist Lambek grammars that assign non-regular structural descriptions, both when considering normal and non-normal proof trees. Combining the results of Pentus (1993) and Thatcher (1967), we can conclude that Lambek grammars, although generating only context-free languages, can extend the strong generative capacity of context-free grammars. Furthermore, we show that structural

• Type: Conference
• Year: 1998
• Where: LACL
• Authors: Hans-Jörg Tiede
• Keywords: Automated Reasoning, LACL 1998, Lambek Calculus, Lambek Grammars, Natural Deduction Proofs