Soft subexponentials and multiplexing

DOI10.1007/978-3-030-51074-9_29OpenAlexW3039072461MaRDI QIDQ2096472

Stepan Kuznetsov, Vivek Nigam, Andrej Scedrov, Max I. Kanovich

Publication date: 9 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-51074-9_29

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (5)

Complexity of a fragment of infinitary action logic with exponential via non-well-founded proofs ⋮ DisCoCat for Donkey Sentences ⋮ Infinitary action logic with multiplexing ⋮ Unnamed Item ⋮ Infinitary action logic with exponentiation

Cites Work

• Unnamed Item
• Light linear logics with controlled weakening: expressibility, confluent strong normalization
• The logic of categorial grammars. A deductive account of natural language syntax and semantics
• Linear logic
• A framework for proof systems
• Decision problems for propositional linear logic
• Light linear logic
• Phase semantics for light linear logic
• A linear logical framework
• A logical framework with commutative and non-commutative subexponentials
• Soft linear logic and polynomial time
• L-models and R-models for Lambek calculus enriched with additives and the multiplicative unit
• Undecidability of the Lambek Calculus with a Relevant Modality
• The Mathematics of Sentence Structure
• Quantales and (noncommutative) linear logic
• Logic Programming with Focusing Proofs in Linear Logic
• Reconciling Lambek’s restriction, cut-elimination and substitution in the presence of exponential modalities
• Subexponentials in non-commutative linear logic
• An extended framework for specifying and reasoning about proof systems

This page was built for publication: Soft subexponentials and multiplexing