Light Linear Logic with Controlled Weakening

DOI10.1007/978-3-540-92687-0_17MaRDI QIDQ3605533zbMATH OpenOpenAlexFDO

Authors Max Kanovich

Publication date 24 February 2009

Published in Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-92687-0_17

Mathematics Subject Classification ID

Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Recommendations

• Light linear logics with controlled weakening: expressibility, confluent strong normalization
• scientific article; zbMATH DE number 1231574
• Linear logic and polynomial time
• Light linear logic
• Linear logic by levels and bounded time complexity

Cites work

• Bounded linear logic: A modular approach to polynomial-time computability
• scientific article; zbMATH DE number 786485 (Why is no real title available?)
• scientific article; zbMATH DE number 1392281 (Why is no real title available?)
• scientific article; zbMATH DE number 1424054 (Why is no real title available?)
• Intuitionistic light affine logic
• Light linear logic
• Light types for polynomial time computation in lambda calculus
• Linear logic
• Linear logic and polynomial time
• On an interpretation of safe recursion in light affine logic
• On the computational complexity of cut-elimination in linear logic.
• Phase semantics for light linear logic
• Soft linear logic and polynomial time
• Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic

Cited in

(2)

• Light linear logic
• Light linear logics with controlled weakening: expressibility, confluent strong normalization

This page was built for publication: Light Linear Logic with Controlled Weakening

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