Decision problems for linear logic with least and greatest fixed points

DOI10.4230/LIPICS.FSCD.2022.20MaRDI QIDQ6544115zbMATH OpenFDO

Authors Anupam Das, Abhishek De, Alexis Saurin

Publication date 27 May 2024

Full work available at URL https://doi.org/10.4230/LIPICS.FSCD.2022.20

zbMATH Keywords

decidabilityfixed pointslinear logicvector addition systems

Mathematics Subject Classification ID

Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Recommendations

• Decision problems for propositional linear logic
• PSPACE-completeness of a thread criterion for circular proofs in linear logic with least and greatest fixed points
• Local validity for circular proofs in linear logic with fixed points

Cited in

(6)

• Kleene star, subexponentials without contraction, and infinite computations
• Local validity for circular proofs in linear logic with fixed points
• Cyclic system for an algebraic theory of alternating parity automata
• Peano arithmetic and MALL
• Comparing infinitary systems for linear logic with fixed points
• Failure of cut-elimination in cyclic-proof systems of logic of bunched implications with inductive propositions

This page was built for publication: Decision problems for linear logic with least and greatest fixed points

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