DeepAI AI Chat
Log In Sign Up

A polynomial time algorithm for the Lambek calculus with brackets of bounded order

by   Max Kanovich, et al.

Lambek calculus is a logical foundation of categorial grammar, a linguistic paradigm of grammar as logic and parsing as deduction. Pentus (2010) gave a polynomial-time algorithm for determ- ining provability of bounded depth formulas in the Lambek calculus with empty antecedents allowed. Pentus' algorithm is based on tabularisation of proof nets. Lambek calculus with brackets is a conservative extension of Lambek calculus with bracket modalities, suitable for the modeling of syntactical domains. In this paper we give an algorithm for provability the Lambek calculus with brackets allowing empty antecedents. Our algorithm runs in polynomial time when both the formula depth and the bracket nesting depth are bounded. It combines a Pentus-style tabularisation of proof nets with an automata-theoretic treatment of bracketing.


page 1

page 2

page 3

page 4


Eliminating the unit constant in the Lambek calculus with brackets

We present a translation of the Lambek calculus with brackets and the un...

Proof Search on Bilateralist Judgments over Non-deterministic Semantics

The bilateralist approach to logical consequence maintains that judgment...

The Logic for a Mildly Context-Sensitive Fragment of the Lambek-Grishin Calculus

While context-free grammars are characterized by a simple proof-theoreti...

Unbounded product-form Petri nets

Computing steady-state distributions in infinite-state stochastic system...

Universal Proof Theory: Feasible Admissibility in Intuitionistic Modal Logics

In this paper, we introduce a general family of sequent-style calculi ov...

Cirquent calculus in a nutshell

This paper is a brief and informal presentation of cirquent calculus, a ...