A game semantics for linear logic

From MaRDI portal
Revision as of 05:33, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1192350

DOI10.1016/0168-0072(92)90073-9zbMath0763.03008DBLPjournals/apal/Blass92OpenAlexW1996605832WikidataQ59410904 ScholiaQ59410904MaRDI QIDQ1192350

Andreas Blass

Publication date: 27 September 1992

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/30097




Related Items (65)

On the symmetry of sequentialityPolarized gamesOn the \(\pi\)-calculus and linear logicThe intuitionistic fragment of computability logic at the propositional levelFrom truth to computability. II.Which Logic for the Radical Anti-realist?Game Semantics and the Manifestation ThesisCirquent Calculus in a NutshellPetri nets, Horn programs, linear logic and vector gamesA constructive game semantics for the language of linear logicFUZZY CHU SPACES AND FUZZY TOPOLOGIESGame theoretic analysis of call-by-value computationGames and full completeness for multiplicative linear logicProjecting sequential algorithms on strongly stable functionsA game-theoretic framework for specification and verification of cryptographic protocolsImperative programs as proofs via game semanticsThe taming of recurrences in computability logic through cirquent calculus. IChu spaces as a semantic bridge between linear logic and mathematics.Separating the basic logics of the basic recurrencesEnumerating Independent Linear InferencesProper semantics for substructural logics, from a stalker theoretic point of viewAristotle on Universal Quantification: A Study from the Point of View of Game SemanticsToggling operators in computability logicIntroduction to computability logicResource modalities in tensor logicProof and refutation in MALL as a gameThe variable hierarchy for the games \(\mu \)-calculusBuild your own clarithmetic I: Setup and completenessOn linear rewriting systems for Boolean logic and some applications to proof theoryIntroduction to clarithmetic. IGame-theoretic analysis of call-by-value computationUnnamed ItemLinear Logic Proof Games and OptimizationUnnamed ItemA curious dialogical logic and its composition problemBayesian strategies: probabilistic programs as generalised graphical modelsGame Semantics and Uniqueness of Type Inhabitance in the Simply-Typed λ-CalculusCompleteness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamicsA PSPACE-complete first-order fragment of computability logicTowards Hilbert's 24th Problem: Combinatorial Proof InvariantsInterface synthesis and protocol conversionLinearizing intuitionistic implicationAmbiguous classes in \(\mu\)-calculi hierarchiesOn abstract resource semantics and computability logicA new face of the branching recurrence of computability logic2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03From truth to computability. I.Unnamed ItemCoordination: Reo, Nets, and LogicFree \(\mu\)-latticesSequential operators in computability logicProlegomena to any theory of proof simplicityToward the interpretation of non-constructive reasoning as non-monotonic learningContraction-free Proofs and Finitary Games for Linear LogicDialogue games for many-valued logics -- an overviewMany concepts and two logics of algorithmic reductionOn the Word Problem for ${\it \Sigma\Pi}$ -Categories, and the Properties of Two-Way CommunicationA game-semantic model of computationFrom Parity Games to Circular ProofsThe logic of tasksHandshake GamesFinite games for a predicate logic without contractionsThe propositional logic of elementary tasksFull intuitionistic linear logicConnecting Sequent Calculi with Lorenzen-Style Dialogue Games




Cites Work




This page was built for publication: A game semantics for linear logic