Expressing additives using multiplicatives and subexponentials

DOI10.1017/S0960129516000293zbMath1456.03094OpenAlexW2555571542MaRDI QIDQ4637626

Kaustuv Chaudhuri

Publication date: 25 April 2018

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129516000293

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Cites Work

• Unnamed Item
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• A logical characterization of forward and backward chaining in the inverse method
• Focusing and polarization in linear, intuitionistic, and classical logics
• Decision problems for propositional linear logic
• A General Proof System for Modalities in Concurrent Constraint Programming
• Structural Focalization
• Classical and Intuitionistic Subexponential Logics Are Equally Expressive
• From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
• Logic Programming with Focusing Proofs in Linear Logic
• Specifying Proof Systems in Linear Logic with Subexponentials
• Types for Proofs and Programs
• An extended framework for specifying and reasoning about proof systems