Soft subexponentials and multiplexing
From MaRDI portal
Publication:2096472
Cites work
- A framework for proof systems
- A linear logical framework
- A logical framework with commutative and non-commutative subexponentials
- An extended framework for specifying and reasoning about proof systems
- Decision problems for propositional linear logic
- scientific article; zbMATH DE number 1175489 (Why is no real title available?)
- L-models and R-models for Lambek calculus enriched with additives and the multiplicative unit
- Light linear logic
- Light linear logics with controlled weakening: expressibility, confluent strong normalization
- Linear logic
- Logic Programming with Focusing Proofs in Linear Logic
- Phase semantics for light linear logic
- Quantales and (noncommutative) linear logic
- Reconciling Lambek's restriction, cut-elimination and substitution in the presence of exponential modalities
- Soft linear logic and polynomial time
- Subexponentials in non-commutative linear logic
- The logic of categorial grammars. A deductive account of natural language syntax and semantics
- The Mathematics of Sentence Structure
- Undecidability of the Lambek calculus with a relevant modality
Cited in
(9)- Infinitary action logic with exponentiation
- Complexity of a fragment of infinitary action logic with exponential via non-well-founded proofs
- Infinitary action logic with multiplexing
- scientific article; zbMATH DE number 6746810 (Why is no real title available?)
- DisCoCat for Donkey Sentences
- From double pushout grammars to hypergraph Lambek grammars with and without exponential modality
- Non-commutative linear logic in linguistics
- Lambek calculus with banged atoms for parasitic gaps
- A mixed linear and graded logic: proofs, terms, and models
This page was built for publication: Soft subexponentials and multiplexing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096472)