From double pushout grammars to hypergraph Lambek grammars with and without exponential modality

MaRDI QIDQ6202802zbMATH OpenFDO

Authors Tikhon Pshenitsyn

Publication date 27 February 2024

Full work available at URL https://arxiv.org/abs/2303.15788, https://cgi.cse.unsw.edu.au/~eptcs/paper.cgi?TERMGRAPH2022.1

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Hypergraph Lambek grammars
• Grammars based on a logic of hypergraph languages
• Powerful and NP-complete: hypergraph Lambek grammars
• Multimodality in the Hypergraph Lambek Calculus
• Hypergraph basic categorial grammars

Cites work

• A tutorial on graph transformation
• An infinitary sequent system for the equational theory of *-continuous action lattices
• Complexity of the infinitary Lambek calculus with Kleene star
• Decision problems for propositional linear logic
• Handbook of Graph Grammars and Computing by Graph Transformation
• Hypergraph Lambek grammars
• Linguistic application of first order intuitionistic linear logic
• Soft subexponentials and multiplexing
• Storage Operators and Multiplicative Quantifiers in Many-valued Logics
• The Lambek calculus enriched with additional connectives
• The Mathematics of Sentence Structure

Cited in

(1)

• Multimodality in the Hypergraph Lambek Calculus

This page was built for publication: From double pushout grammars to hypergraph Lambek grammars with and without exponential modality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202802)