Light Linear Logic with Controlled Weakening

DOI10.1007/978-3-540-92687-0_17zbMath1211.03092OpenAlexW1524546465MaRDI QIDQ3605533

Max I. 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)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Light types for polynomial time computation in lambda calculus
• Bounded linear logic: A modular approach to polynomial-time computability
• Light linear logic
• Phase semantics for light linear logic
• Soft linear logic and polynomial time
• On an interpretation of safe recursion in light affine logic
• Linear logic and polynomial time
• Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic
• Intuitionistic Light Affine Logic
• Theoretical Computer Science