Computer Science Logic

DOI10.1007/11538363MaRDI QIDQ5394577zbMATH OpenOpenAlexFDO

Authors Jean-Marc Andreoli, Gabriele Pulcini, Paul Ruet

Publication date 1 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11538363

Mathematics Subject Classification ID

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

Recommendations

• Permutative Additives and Exponentials
• Two-dimensional proof-structures and the exchange rule
• A geometrical procedure for computing relaxation
• Implicit exchange in multiplicative proofnets
• On proof normalization in linear logic

Cited in

(7)

• A geometrical procedure for computing relaxation
• Permutation dependency in datalog programs
• Implicit exchange in multiplicative proofnets
• Permutative Additives and Exponentials
• Two-dimensional proof-structures and the exchange rule
• A System of Interaction and Structure III: The Complexity of BV and Pomset Logic
• Implicit automata in typed -calculi I: aperiodicity in a non-commutative logic

This page was built for publication: Computer Science Logic

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