Specifying Proof Systems in Linear Logic with Subexponentials
From MaRDI portal
Publication:5179015
DOI10.1016/j.entcs.2011.03.009zbMath1347.03103OpenAlexW2008788038WikidataQ57850836 ScholiaQ57850836MaRDI QIDQ5179015
Elaine Pimentel, Giselle Reis, Vivek Nigam
Publication date: 18 March 2015
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2011.03.009
Related Items
Dynamic spaces in concurrent constraint programming, On subexponentials, focusing and modalities in concurrent systems, A Survey of the Proof-Theoretic Foundations of Logic Programming, Subexponential concurrent constraint programming, Unnamed Item, A framework for linear authorization logics, Expressing additives using multiplicatives and subexponentials, Hybrid and subexponential linear logics, Hybrid linear logic, revisited, Finite-valued semantics for canonical labelled calculi
Cites Work
- Algebraic proof theory for substructural logics: cut-elimination and completions
- Forum: A multiple-conclusion specification logic
- Focusing and polarization in linear, intuitionistic, and classical logics
- Focusing in Linear Meta-logic
- Logic Programming with Focusing Proofs in Linear Logic
- On the Specification of Sequent Systems
- A formulation of the simple theory of types
- Eine Darstellung der Intuitionistischen Logik in der Klassischen
- Logical Approaches to Computational Barriers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item