First-order intuitionistic linear logic and hypergraph languages
From MaRDI portal
Cites work
- A note on the complexity of abstract categorial grammars
- A system of graph grammars which generates all recursively enumerable sets of labelled graphs
- A tutorial on graph transformation
- Commutative Lambek grammars
- Compatibility of a Categorial Grammar With an Associated Category System
- Double-pushout graph transformation revisited
- Extended Lambek calculi and first-order linear logic
- Graph structure and monadic second-order logic. A language-theoretic approach
- Handbook of Graph Grammars and Computing by Graph Transformation
- scientific article; zbMATH DE number 2070201 (Why is no real title available?)
- scientific article; zbMATH DE number 3230262 (Why is no real title available?)
- Hyperedge replacement: grammars and languages
- Hypergraph Lambek grammars
- Intuitionistic phase semantics is almost classical
- Lambek calculus is NP-complete
- Linguistic application of first order intuitionistic linear logic
- Logic Programming with Focusing Proofs in Linear Logic
- Making first order linear logic a generating grammar
- Models for the Lambek calculus
- Multimodal linguistic inference
- On the complexity of formal grammars
- Parsing beyond context-free grammars
- Predicate logics without the structure rules
- Some Syntactical Observations on Linear Logic
- The displacement calculus
- The logic of categorial grammars. A deductive account of natural language syntax and semantics
- The Mathematics of Sentence Structure
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Theory of one-tape linear-time Turing machines
- Time-bounded grammars and their languages
This page was built for publication: First-order intuitionistic linear logic and hypergraph languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7397631)
