Phase semantics for light linear logic

DOI10.1016/S0304-3975(01)00177-3zbMath1029.03052OpenAlexW2058763998MaRDI QIDQ1398478

Max I. Kanovich, Mitsuhiro Okada, Andrej Scedrov

Publication date: 29 July 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00177-3

zbMATH Keywords

cut eliminationlight linear logicfibred phase spaces

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items

Phase semantics and decidability of elementary affine logic, Light affine lambda calculus and polynomial time strong normalization, Light linear logics with controlled weakening: expressibility, confluent strong normalization, Type inference for light affine logic via constraints on words, Light Linear Logic with Controlled Weakening, Towards a theory of resource: an approach based on soft exponentials, Realizability models for BLL-like languages, Soft subexponentials and multiplexing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Bounded linear logic: A modular approach to polynomial-time computability
• Light linear logic
• Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic
• A uniform semantic proof for cut-elimination and completeness of various first and higher order logics.
• The undecidability of second order multiplicative linear logic
• The finite model property for various fragments of intuitionistic linear logic
• The undecidability of second order linear logic without exponentials