Syntax vs. semantics: A polarized approach

DOI10.1016/J.TCS.2005.05.012zbMath1079.03058OpenAlexW2068763700MaRDI QIDQ2570132

Olivier Laurent

Publication date: 26 October 2005

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.05.012

zbMATH Keywords

Linear logicPolarizationProof-netsGame semanticsFull and faithful completeness

Mathematics Subject Classification ID

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

Related Items (7)

Jump from parallel to sequential proofs: exponentials ⋮ The relational model is injective for multiplicative exponential linear logic (without weakenings) ⋮ Preface to the special volume ⋮ An exact correspondence between a typed pi-calculus and polarised proof-nets ⋮ A phase semantics for polarized linear logic and second order conservativity ⋮ Thick Subtrees, Games and Experiments ⋮ Rewritings for Polarized Multiplicative and Exponential Proof Structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polarized and focalized linear and classical proofs
• Linear logic
• Full abstraction for idealized Algol with passive expressions
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Dependent choice, `quote' and the clock
• Polarized games
• Linear Läuchli semantics
• Control categories and duality: on the categorical semantics of the lambda-mu calculus
• Locus Solum: From the rules of logic to the logic of rules
• Classical isomorphisms of types
• A new constructive logic: classic logic
• Games and full completeness for multiplicative linear logic
• Obsessional experiments for linear logic proof-nets

This page was built for publication: Syntax vs. semantics: A polarized approach