A Logical Framework with Commutative and Non-commutative Subexponentials

  title={A Logical Framework with Commutative and Non-commutative Subexponentials},
  author={Max I. Kanovich and Stepan L. Kuznetsov and Vivek Nigam and Andre Scedrov},
Logical frameworks allow the specification of deductive systems using the same logical machinery. Linear logical frameworks have been successfully used for the specification of a number of computational, logics and proof systems. Its success relies on the fact that formulas can be distinguished as linear, which behave intuitively as resources, and unbounded, which behave intuitionistically. Commutative subexponentials enhance the expressiveness of linear logic frameworks by allowing the… 
Soft Subexponentials and Multiplexing
This work introduces a non-commutative substructural system with subexponential modalities controlled by a minimalistic set of rules and employs Lambek’s non-emptiness restriction, which is incompatible with the standard (sub)exponential setting.
Reconciling Lambek's restriction, cut-elimination, and substitution in the presence of exponential modalities
It is shown that for any system equipped with a reasonable exponential modality the following holds: if the system enjoys cut elimination and substitution to the full extent, then the system necessarily violates Lambek's restriction, and two of the three conditions can be implemented.
Logic, Language, and Security: Essays Dedicated to Andre Scedrov on the Occasion of His 65th Birthday
An upper Π 1 bound is shown for the fragment of infinitary action logic, in which the exponential can be applied only to formulae of implication depth 0 or 1.
Quantale semantics of Lambek calculus with subexponential modalities
The polymodal version of Lambek calculus with subexponential modalities initially introduced by Kanovich, Kuznetsov, Nigam, and Scedrov and its quantale semantics is considered and a representation theorem for quantales with quantic conuclei is proved.
Undecidability of a Newly Proposed Calculus for CatLog3
It is proved that the derivability problem for a fragment of this substructural calculus is algorithmically undecidable.
Dynamic Logic. New Trends and Applications: Third International Workshop, DaLí 2020, Prague, Czech Republic, October 9–10, 2020, Revised Selected Papers
This work identifies a graph structure for events based on their relative dependence of occurence and introduces a generic product update based on the concepts of event model and product update.
Bracket Induction for Lambek Calculus with Bracket Modalities
This paper shows how parsing can be realised which induces the bracketing structure in backward chaining sequent proof search with Lb, the Lambek calculus with bracket modalities Lb.
The Logic of Action Lattices is Undecidable
  • S. Kuznetsov
  • Mathematics
    2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  • 2019
We prove algorithmic undecidability of the (in)equational theory of residuated Kleene lattices (action lattices), thus solving a problem left open by D. Kozen, P. Jipsen, W. Buszkowski.
Infinitary Action Logic with Exponentiation
The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities
A proof-theoretic and algorithmic complexity analysis for systems introduced by Morrill to serve as the core of the CatLog categorial grammar parser shows that categorial grammars based on them can generate arbitrary recursively enumerable languages.


Subexponentials in non-commutative linear logic
Conditions for when cut elimination is admissible in the presence of non-commutative subexponentials are investigated, investigating the interaction of the exchange rule with the local and non-local contraction rules.
Exploiting non-canonicity in the sequent calculus
This thesis provides a proof theoretic explanation for tabled deduction by exploiting the fact that in intuitionistic logic atoms can be assigned arbitrary polarity, and shows that linear logic can be used as a general framework for encoding proof systems for minimal, intuitionistic, and classical logics.
Algorithmic specifications in linear logic with subexponentials
This work shows that focused proof search can be precisely linked to a simple algorithmic specification language that contains while-loops, conditionals, and insertion into and deletion from multisets and proposes a new logical connective that allows for the creation of new subexponentials, thereby further augmenting the algorithmic expressiveness of logic.
Subexponential concurrent constraint programming
A framework for defining logics
The Edinburgh Logical Framework provides a means to define (or present) logics through a general treatment of syntax, rules, and proofs by means of a typed λ-calculus with dependent types, whereby each judgment is identified with the type of its proofs.
A Framework for Proof Systems
It is shown that by providing different polarizations within a focused proof system for linear logic, one can account for natural deduction, sequent proofs, and tableaux proofs.
An extended framework for specifying and reasoning about proof systems
This paper shows how to extend the framework with subexponentials in order to declaratively encode a wider range of proof systems, including a number of non-trivial proof systems such as multi-conclusion intuitionistic logic, classical modal logic S4, intuitionistic Lax logic, and Negri’s labelled proof systems for different modal logics.
Logic programming in a fragment of intuitionistic linear logic
  • J. S. Hodas, Dale Miller
  • Computer Science
    [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science
  • 1991
The intuitionistic notion of context is refined by using a fragment of J.-Y. Girard's (Theor. Comput. Sci., vol.50, p.1-102, 1987) linear logic that includes additive and multiplicative conjunction,
Weak Focusing for Ordered Linear Logic (CMU-CS-10-147)
It is shown how the cut and identity theorem can be used in a straightforward manner to establish the completeness of the weakly focusedsequent calculus with respect to an non-focused sequent calculus for ordered linear logic.
Undecidability of the Lambek Calculus with Subexponential and Bracket Modalities
Undecidability of the derivability problem in the Lambek calculus is proved and restricted decidable fragments considered by Morrill and Valentin are investigated and it is shown that these fragments belong to the NP class.