Games and full completeness for multiplicative linear logic
From MaRDI portal
Publication:4302352
DOI10.2307/2275407zbMath0822.03007arXiv1311.6057OpenAlexW2094685149WikidataQ57006867 ScholiaQ57006867MaRDI QIDQ4302352
Samson Abramsky, Radha Jagadeesan
Publication date: 15 August 1994
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.6057
Related Items (88)
Conway Games, Coalgebraically ⋮ Equivalences and Congruences on Infinite Conway Games ⋮ Comparing hierarchies of types in models of linear logic ⋮ MELL in the calculus of structures ⋮ Polarized games ⋮ On the \(\pi\)-calculus and linear logic ⋮ Games for Dependent Types ⋮ GAME FORMATS AS CHU SPACES ⋮ Game semantics for dependent types ⋮ Game Semantics and the Manifestation Thesis ⋮ A constructive game semantics for the language of linear logic ⋮ A categorical semantics for polarized MALL ⋮ Strong normalisation in the \(\pi\)-calculus ⋮ Game theoretic analysis of call-by-value computation ⋮ Linear Läuchli semantics ⋮ Projecting sequential algorithms on strongly stable functions ⋮ Imperative programs as proofs via game semantics ⋮ Modeling linear logic with implicit functions ⋮ A comparison between monoidal and substructural logics ⋮ Glueing and orthogonality for models of linear logic ⋮ Exhausting strategies, joker games and full completeness for IMLL with unit ⋮ Chu spaces as a semantic bridge between linear logic and mathematics. ⋮ Retracing some paths in process algebra ⋮ Proper semantics for substructural logics, from a stalker theoretic point of view ⋮ An approach to innocent strategies as graphs ⋮ Game semantics of Martin-Löf type theory ⋮ Constructive semantics for instantaneous reactions ⋮ Relative full completeness for bicategorical Cartesian closed structure ⋮ Introduction to computability logic ⋮ Resource modalities in tensor logic ⋮ Proof and refutation in MALL as a game ⋮ The variable hierarchy for the games \(\mu \)-calculus ⋮ Introduction to clarithmetic. I ⋮ Semantic games with chance moves revisited: from IF logic to partial logic ⋮ Game-theoretic analysis of call-by-value computation ⋮ A specification structure for deadlock-freedom of synchronous processes ⋮ Unnamed Item ⋮ The categorical imperative: category theory as a foundation for deontic logic ⋮ Quantum coherent spaces and linear logic ⋮ Logic and Geometry of Agents in Agent-Based Modeling ⋮ Traces for coalgebraic components ⋮ Games and Definability For FPC ⋮ A game semantics of names and pointers ⋮ Maximality and totality of stable functions in the category of stable bifinite domains ⋮ A Game Semantics of Idealized CSP ⋮ Quantum circuit oracles for abstract machine computations ⋮ Towards Hilbert's 24th Problem: Combinatorial Proof Invariants ⋮ Preface to the special volume ⋮ System NEL is Undecidable ⋮ Modularity of proof-nets. Generating the type of a module. ⋮ Softness of hypercoherences and MALL full completeness ⋮ Coherent phase spaces. Semiclassical semantics ⋮ Linear realizability and full completeness for typed lambda-calculi ⋮ Unnamed Item ⋮ A game semantics for generic polymorphism ⋮ From truth to computability. I. ⋮ Free \(\mu\)-lattices ⋮ Sequential operators in computability logic ⋮ Slime mould games based on rough set theory ⋮ Least and Greatest Fixpoints in Game Semantics ⋮ Toward the interpretation of non-constructive reasoning as non-monotonic learning ⋮ Some Programming Languages Suggested by Game Models (Extended Abstract) ⋮ Game Semantics for Access Control ⋮ Contraction-free Proofs and Finitary Games for Linear Logic ⋮ Dialogue games for many-valued logics -- an overview ⋮ Many concepts and two logics of algorithmic reduction ⋮ Epistemic Strategies and Games on Concurrent Processes ⋮ Modelling simultaneous games in dynamic logic ⋮ lambda!-calculus, Intersection Types, and Involutions ⋮ On the Word Problem for ${\it \Sigma\Pi}$ -Categories, and the Properties of Two-Way Communication ⋮ Poset-valued sets or how to build models for linear logics ⋮ A game-semantic model of computation ⋮ Merging frameworks for interaction ⋮ Proof-search in type-theoretic languages: An introduction ⋮ From Parity Games to Circular Proofs ⋮ \(\mathbb{Z}\)-modules and full completeness of multiplicative linear logic ⋮ Syntax vs. semantics: A polarized approach ⋮ Sequential algorithms and strongly stable functions ⋮ Towards Ludics Programming: Interactive Proof Search ⋮ The logic of tasks ⋮ Games and full abstraction for FPC. ⋮ Full abstraction for PCF ⋮ A structural approach to reversible computation ⋮ Event Domains, Stable Functions and Proof-Nets ⋮ Definability and Full Abstraction ⋮ Unnamed Item ⋮ Connecting Sequent Calculi with Lorenzen-Style Dialogue Games ⋮ A calculus of coroutines
Cites Work
- Linear logic
- Linear logic, coherence and dinaturality
- Computational interpretations of linear logic
- Functorial polymorphism
- The system \({\mathcal F}\) of variable types, fifteen years later
- A game semantics for linear logic
- LCF considered as a programming language
- The structure of multiplicatives
- *-Autonomous categories and linear logic
- A new constructive logic: classic logic
- Quantales, observational logic and process semantics
This page was built for publication: Games and full completeness for multiplicative linear logic
