Decidability of linear affine logic

DOI10.1006/inco.1999.2834zbMath1007.03053OpenAlexW2111753732MaRDI QIDQ1854403

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

normal formsdecidabilityfull propositional linear affine logic

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)

Related Items (11)

Linear and affine logics with temporal, spatial and epistemic operators ⋮ Strong planning under uncertainty in domains with numerous but identical elements (a generic approach) ⋮ Phase semantics and decidability of elementary affine logic ⋮ THE LOGIC OF RESOURCES AND CAPABILITIES ⋮ Nonelementary Complexities for Branching VASS, MELL, and Extensions ⋮ Judgement aggregation in non-classical logics ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The decidability of the intensional fragment of classical linear logic ⋮ Non-associative, non-commutative multi-modal linear logic ⋮ Interpretations of Weak Positive Modal Logics

Cites Work

• Linear logic
• Unnamed Item
• Unnamed Item

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