scientific article; zbMATH DE number 1222110

zbMATH Open0936.03057MaRDI QIDQ4217606FDOQ4217606

Authors: Satoshi Matsuoka 

Publication date: 16 March 2000

Title of this publication is not available (Why is that?)

Recommendations

• Proof nets for unit-free multiplicative-additive linear logic
• A linear algorithm for MLL proof net correctness and sequentialization
• A new correctness criterion for MLL proof nets
• A new correctness criterion for the proof nets of non-commutative multiplicative linear logics

zbMATH Keywords

algorithmpolynomial timecorrectness criterionproof-netsproof-searchboolean weightsmultiplicative and additive linear logicproof-structure

Mathematics Subject Classification ID

Structure of proofs (03F07) Complexity of proofs (03F20) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Cited In (8)

• New uses of linear arithmetic in automated theorem proving by induction
• A linear algorithm for MLL proof net correctness and sequentialization
• Title not available (Why is that?)
• The additive multiboxes
• Softness of MALL proof-structures and a correctness criterion with Mix
• An even closer integration of linear arithmetic into inductive theorem proving
• Title not available (Why is that?)
• Linear strategy for Boolean ring based theorem proving

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 Q4217606)