scientific article; zbMATH DE number 7359406

DOI10.4230/LIPICS.FSCD.2018.10MaRDI QIDQ4993336zbMATH OpenFDO

Authors Gianluigi Bellin, Willem Heijltjes

Publication date 15 June 2021

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

zbMATH Keywords

contractibilityintuitionistic linear logiclinear logicproof nets

Mathematics Subject Classification ID

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

Recommendations

• Proof-search and proof nets in mixed linear logic
• Proof nets for multiplicative cyclic linear logic and Lambek calculus
• Proof nets and the linear substitution calculus
• Proof nets for unit-free multiplicative-additive linear logic
• Proof Nets for Lambek Calculus
• Proof nets for first-order additive linear logic
• Bisimulation and propositional intuitionistic logic
• Proof-nets, hybrid logics and minimalist representations
• Natural deduction for bi-intuitionistic logic
• scientific article; zbMATH DE number 6296859

Cites work

• A note on full intuitionistic linear logic
• Annotation-free sequent calculi for full intuitionistic linear logic
• Correctness of linear logic proof structures is NL-complete
• Exhausting strategies, joker games and full completeness for IMLL with unit
• Full intuitionistic linear logic
• scientific article; zbMATH DE number 1024333 (Why is no real title available?)
• scientific article; zbMATH DE number 786495 (Why is no real title available?)
• scientific article; zbMATH DE number 3316072 (Why is no real title available?)
• Linear logic
• Multiple conclusion linear logic: cut elimination and more
• Parsing MELL proof nets
• Proof equivalence in MLL is PSPACE-complete
• Simple free star-autonomous categories and full coherence
• Some Syntactical Observations on Linear Logic
• The structure of multiplicatives
• Weakly distributive categories

Cited in

(8)

• Interaction nets for linear logic
• A theorem prover for Boolean BI
• Annotation-free sequent calculi for full intuitionistic linear logic
• From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing
• scientific article; zbMATH DE number 1231699 (Why is no real title available?)
• An introduction to differential linear logic: proof-nets, models and antiderivatives
• On intuitionistic proof nets with additional rewrite rules and their approximations
• Non-deterministic Boolean Proof Nets

This page was built for publication:

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