Pages that link to "Item:Q4302352"
From MaRDI portal
The following pages link to Games and full completeness for multiplicative linear logic (Q4302352):
Displaying 50 items.
- Imperative programs as proofs via game semantics (Q388203) (← links)
- Modeling linear logic with implicit functions (Q392296) (← links)
- An approach to innocent strategies as graphs (Q418201) (← links)
- The categorical imperative: category theory as a foundation for deontic logic (Q472796) (← links)
- Preface to the special volume (Q534064) (← links)
- Linear realizability and full completeness for typed lambda-calculi (Q556821) (← links)
- Strong normalisation in the \(\pi\)-calculus (Q598201) (← links)
- Constructive semantics for instantaneous reactions (Q631753) (← links)
- Resource modalities in tensor logic (Q636303) (← links)
- Proof and refutation in MALL as a game (Q636305) (← links)
- The variable hierarchy for the games \(\mu \)-calculus (Q636308) (← links)
- Introduction to clarithmetic. I (Q642523) (← links)
- Softness of hypercoherences and MALL full completeness (Q705530) (← links)
- Coherent phase spaces. Semiclassical semantics (Q705538) (← links)
- A calculus of coroutines (Q817847) (← links)
- A categorical semantics for polarized MALL (Q866570) (← links)
- Quantum circuit oracles for abstract machine computations (Q960862) (← links)
- Sequential operators in computability logic (Q999265) (← links)
- Toward the interpretation of non-constructive reasoning as non-monotonic learning (Q1004290) (← links)
- Dialogue games for many-valued logics -- an overview (Q1005947) (← links)
- Many concepts and two logics of algorithmic reduction (Q1005975) (← links)
- Modelling simultaneous games in dynamic logic (Q1024134) (← links)
- Merging frameworks for interaction (Q1037376) (← links)
- On the \(\pi\)-calculus and linear logic (Q1342247) (← links)
- A constructive game semantics for the language of linear logic (Q1361252) (← links)
- Glueing and orthogonality for models of linear logic (Q1398466) (← links)
- Exhausting strategies, joker games and full completeness for IMLL with unit (Q1398468) (← links)
- Chu spaces as a semantic bridge between linear logic and mathematics. (Q1398475) (← links)
- Introduction to computability logic (Q1408853) (← links)
- Proof-search in type-theoretic languages: An introduction (Q1575935) (← links)
- Game semantics for dependent types (Q1641014) (← links)
- Modularity of proof-nets. Generating the type of a module. (Q1766921) (← links)
- A game semantics for generic polymorphism (Q1772770) (← links)
- Slime mould games based on rough set theory (Q1797883) (← links)
- Poset-valued sets or how to build models for linear logics (Q1826627) (← links)
- \(\mathbb{Z}\)-modules and full completeness of multiplicative linear logic (Q1840462) (← links)
- The logic of tasks (Q1849860) (← links)
- Games and full abstraction for FPC. (Q1854351) (← links)
- Full abstraction for PCF (Q1854394) (← links)
- Comparing hierarchies of types in models of linear logic (Q1881220) (← links)
- MELL in the calculus of structures (Q1884903) (← links)
- Polarized games (Q1886321) (← links)
- Linear Läuchli semantics (Q1919529) (← links)
- Projecting sequential algorithms on strongly stable functions (Q1919532) (← links)
- Game-theoretic analysis of call-by-value computation (Q1960532) (← links)
- A specification structure for deadlock-freedom of synchronous processes (Q1960536) (← links)
- Relative full completeness for bicategorical Cartesian closed structure (Q2200828) (← links)
- A game-semantic model of computation (Q2319854) (← links)
- Proper semantics for substructural logics, from a stalker theoretic point of view (Q2426733) (← links)
- Semantic games with chance moves revisited: from IF logic to partial logic (Q2441754) (← links)
