Decidability of linear affine logic

DOI10.1006/INCO.1999.2834MaRDI QIDQ1854403zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 14 January 2003

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.1999.2834

zbMATH Keywords

decidabilityfull propositional linear affine logicnormal forms

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Cut-elimination and normal-form theorems (03F05) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Recommendations

• scientific article; zbMATH DE number 1114339
• The finite model property for various fragments of linear logic
• Phase semantics and decidability of elementary affine logic
• scientific article; zbMATH DE number 1420859
• The decidability of the intensional fragment of classical linear logic

Cites work

• scientific article; zbMATH DE number 1479638 (Why is no real title available?)
• scientific article; zbMATH DE number 1489627 (Why is no real title available?)
• Linear logic

Cited in

(18)

• Decision problems for propositional linear logic
• Non-associative, non-commutative multi-modal linear logic
• Linear and affine logics with temporal, spatial and epistemic operators
• Strong planning under uncertainty in domains with numerous but identical elements (a generic approach)
• The decidability of the intensional fragment of classical linear logic
• scientific article; zbMATH DE number 1114339 (Why is no real title available?)
• Affine sessions
• THE LOGIC OF RESOURCES AND CAPABILITIES
• Judgement aggregation in non-classical logics
• scientific article; zbMATH DE number 786489 (Why is no real title available?)
• scientific article; zbMATH DE number 1420859 (Why is no real title available?)
• Interpretations of weak positive modal logics
• scientific article; zbMATH DE number 7455712 (Why is no real title available?)
• Modalities in lattice-R
• Decidability of affine solution problems
• Detecting Loops During Proof Search in Propositional Affine Logic
• Phase semantics and decidability of elementary affine logic
• Exponentially handsome proof nets and their normalization

This page was built for publication: Decidability of linear affine logic

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