Saturated formulas in full linear logic

DOI10.1093/LOGCOM/8.5.665MaRDI QIDQ4221298zbMATH OpenOpenAlexFDO

Authors Maurizio Castellan, Mario Piazza

Publication date 3 January 1999

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/8.5.665

zbMATH Keywords

contractionexponentiated formulasfull linear logicmodalitiessaturated formulassequent calculusweakening

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Proof theory in general (including proof-theoretic semantics) (03F03)

Recommendations

• Decision problems for propositional linear logic
• Contraction-free proofs and finitary games for linear logic
• Formulas for which contraction is admissible
• A modal view of linear logic

Cited in

(2)

• Exchange rules
• Simple Saturated Sets for Disjunction and Second-Order Existential Quantification

This page was built for publication: Saturated formulas in full linear logic

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