The following pages link to A game semantics for linear logic (Q1192350):
Displaying 50 items.
- A micrological study of negation (Q345707) (← links)
- Imperative programs as proofs via game semantics (Q388203) (← links)
- Separating the basic logics of the basic recurrences (Q409329) (← links)
- A curious dialogical logic and its composition problem (Q484198) (← links)
- A game-theoretic framework for specification and verification of cryptographic protocols (Q607405) (← links)
- Toggling operators in computability logic (Q631756) (← 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)
- A new face of the branching recurrence of computability logic (Q712555) (← links)
- On abstract resource semantics and computability logic (Q980944) (← 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)
- Linearizing intuitionistic implication (Q1210141) (← links)
- Finite games for a predicate logic without contractions (Q1314388) (← links)
- Full intuitionistic linear logic (Q1314646) (← links)
- On the \(\pi\)-calculus and linear logic (Q1342247) (← links)
- A parallel game semantics for linear logic (Q1360314) (← links)
- A constructive game semantics for the language of linear logic (Q1361252) (← links)
- Chu spaces as a semantic bridge between linear logic and mathematics. (Q1398475) (← links)
- Introduction to computability logic (Q1408853) (← links)
- Interpreting sequent calculi as client-server games (Q1694453) (← links)
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics (Q1749477) (← links)
- Ambiguous classes in \(\mu\)-calculi hierarchies (Q1770419) (← links)
- The logic of tasks (Q1849860) (← links)
- The propositional logic of elementary tasks (Q1861137) (← links)
- Polarized games (Q1886321) (← links)
- Petri nets, Horn programs, linear logic and vector games (Q1899147) (← links)
- Projecting sequential algorithms on strongly stable functions (Q1919532) (← links)
- The taming of recurrences in computability logic through cirquent calculus. I (Q1935369) (← links)
- Game-theoretic analysis of call-by-value computation (Q1960532) (← links)
- Bayesian strategies: probabilistic programs as generalised graphical models (Q2233478) (← links)
- A game-semantic model of computation (Q2319854) (← links)
- The intuitionistic fragment of computability logic at the propositional level (Q2373697) (← links)
- From truth to computability. II. (Q2373705) (← links)
- Proper semantics for substructural logics, from a stalker theoretic point of view (Q2426733) (← links)
- Interface synthesis and protocol conversion (Q2481210) (← links)
- From truth to computability. I. (Q2500484) (← links)
- On the meaning of logical rules. II: Multiplicatives and additives (Q2752054) (← links)
- Evolving games and essential nets for affine polymorphism (Q2778832) (← links)
- Contraction-free proofs and finitary games for linear logic (Q2805162) (← links)
- From parity games to circular proofs (Q2842563) (← links)
- Asynchronous games 3 an innocent model of linear logic (Q2849884) (← links)
- A game semantics for proof search (preliminary results) (Q2852368) (← links)
- Handshake games (Q2864210) (← links)
- Which Logic for the Radical Anti-realist? (Q2908756) (← links)
- Game Semantics and the Manifestation Thesis (Q2908761) (← links)
