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 c...
The logic behind parsers for categorial grammars can be formalized in several different ways. Lambek Calculus (LC) constitutes an example for a natural deduction 1 style parsing m...
Two-way alternating automata were introduced by Vardi in order to study the satisfiability problem for the modal µ-calculus extended with backwards modalities. In this paper, we ...
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...