Undecidability of multiplicative subexponential logic

MaRDI QIDQ5015208zbMATH OpenFDO

Authors Kaustuv Chaudhuri

Publication date 6 December 2021

Full work available at URL https://arxiv.org/abs/1502.04769, http://eptcs.web.cse.unsw.edu.au/paper.cgi?LINEARITY2014.1

Mathematics Subject Classification ID

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

Recommendations

• Expressing additives using multiplicatives and subexponentials
• The undecidability of second order linear logic without exponentials
• The undecidability of second order multiplicative linear logic
• scientific article; zbMATH DE number 1500655
• scientific article; zbMATH DE number 5289966

Cites work

• A general proof system for modalities in concurrent constraint programming
• A logical characterization of forward and backward chaining in the inverse method
• Classical and intuitionistic subexponential logics are equally expressive
• Decision problems for propositional linear logic
• Focusing and polarization in linear, intuitionistic, and classical logics
• From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
• Logic Programming with Focusing Proofs in Linear Logic
• On the complexity of linear authorization logics
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Specifying proof systems in linear logic with subexponentials
• Structural focalization

Cited in

(13)

• Undecidability results on two-variable logics
• On the decision problem for MELL
• Non-associative, non-commutative multi-modal linear logic
• Undecidable iterative propositional calculus
• Classical and intuitionistic subexponential logics are equally expressive
• scientific article; zbMATH DE number 2064466 (Why is no real title available?)
• scientific article; zbMATH DE number 1500655 (Why is no real title available?)
• Expressing additives using multiplicatives and subexponentials
• System NEL is undecidable
• MOST SIMPLE EXTENSIONS OF ARE UNDECIDABLE
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Synthetic Undecidability of MSELL via FRACTRAN Mechanised in Coq
• Super exponentials in linear logic

This page was built for publication: Undecidability of multiplicative subexponential logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5015208)