DeepAI AI Chat
Log In Sign Up

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

by   Hiroyoshi Komatsu, et al.

While context-free grammars are characterized by a simple proof-theoretic grammatical formalism namely categorial grammar and its logic the Lambek calculus, no such characterizations were known for tree-adjoining grammars, and even for any mildly context-sensitive languages classes in the last forty years despite some efforts. We settle this problem in this paper. On the basis of the existing fragment of the Lambek-Grishin calculus which captures tree-adjoining languages, we present a logic called HLG: a proof-theoretic characterization of tree-adjoining languages based on the Lambek-Grishin calculus restricted to Hyperedge-replacement grammar with rank two studied by Moot. HLG is defined in display calculus with cut-admissibility. Several new techniques are introduced for the proofs, such as purely structural connectives, usefulness, and a graph-theoretic argument on proof nets for HLG.


page 1

page 2

page 3

page 4


Proof-theoretic aspects of NLλ

We present a proof-theoretic analysis of the logic NLλ (Barker & Shan 20...

Formalized Lambek Calculus in Higher Order Logic (HOL4)

In this project, a rather complete proof-theoretical formalization of La...

Introducing Proof Tree Automata and Proof Tree Graphs

In structural proof theory, designing and working on large calculi make ...

Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested Sequents

This paper employs the recently introduced linear nested sequent framewo...

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

Lambek calculus is a logical foundation of categorial grammar, a linguis...

Grammars Based on a Logic of Hypergraph Languages

The hyperedge replacement grammar (HRG) formalism is a natural and well-...

Cirquent calculus in a nutshell

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