Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets

DOI10.1007/978-3-642-02444-3_19zbMath1246.03075OpenAlexW1594324732MaRDI QIDQ3638260

Luca Roversi, Luca Vercelli

Publication date: 2 July 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-02444-3_19

zbMATH Keywords

linear logicimplicit computational complexitystructural proof theorypolynomial time computations

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Structure of proofs (03F07) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Complexity of proofs (03F20)

Related Items (1)

Paths-based criteria and application to linear logic subsystems characterizing polynomial time

Cites Work

• Linear logic
• Linear logic by levels and bounded time complexity
• Light linear logic
• Linear types and non-size-increasing polynomial time computation.
• On an interpretation of safe recursion in light affine logic
• 2-Sequent Calculus: Intuitionism and Natural Deduction
• Intuitionistic Light Affine Logic
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets