Concurrent games and full completeness
A new concurrent form of game semantics is introduced. This overcomes the problems
which had arisen with previous, sequential forms of game semantics in modelling Linear …
which had arisen with previous, sequential forms of game semantics in modelling Linear …
Introduction to computability logic
G Japaridze - Annals of Pure and Applied Logic, 2003 - Elsevier
This work is an attempt to lay foundations for a theory of interactive computation and bring
logic and theory of computing closer together. It semantically introduces a logic of …
logic and theory of computing closer together. It semantically introduces a logic of …
Asynchronous games 4: A fully complete model of propositional linear logic
PA Mellies - 20th Annual IEEE Symposium on Logic in …, 2005 - ieeexplore.ieee.org
We construct a denotational model of propositional linear logic based on asynchronous
games and winning uniform innocent strategies. Every formula A is interpreted as an …
games and winning uniform innocent strategies. Every formula A is interpreted as an …
[PDF][PDF] Proof nets for unit-free multiplicative-additive linear logic
A cornerstone of the theory of proof nets for unit-free multiplicative linear logic (MLL) is the
abstract representation of cut-free proofs modulo inessential rule commutation. The only …
abstract representation of cut-free proofs modulo inessential rule commutation. The only …
Proof nets for unit-free multiplicative-additive linear logic
A cornerstone of the theory of proof nets for unit-free multiplicative linear logic (MLL) is the
abstract representation of cut-free proofs modulo inessential rule commutation. The only …
abstract representation of cut-free proofs modulo inessential rule commutation. The only …
[PDF][PDF] Category theory for linear logicians
R Blute, P Scott - Linear logic in computer science, 2004 - asc.ohio-state.edu
This paper presents an introduction to category theory with an emphasis on those aspects
relevant to the analysis of the model theory of linear logic. With this in mind, we focus on the …
relevant to the analysis of the model theory of linear logic. With this in mind, we focus on the …
Questions and answers—a category arising in linear logic, complexity theory, and set theory
A Blass - Advances in linear logic, 1995 - books.google.com
A category used by de Paiva to model linear logic also occurs in Vojtáš's analysis of cardinal
characteristics of the continuum. Its morphisms have been used in describing reductions …
characteristics of the continuum. Its morphisms have been used in describing reductions …
From truth to computability I
G Japaridze - Theoretical computer science, 2006 - Elsevier
The recently initiated approach called computability logic is a formal theory of interactive
computation. It understands computational problems as games played by a machine against …
computation. It understands computational problems as games played by a machine against …
Definability and full abstraction
PL Curien - Electronic Notes in Theoretical Computer Science, 2007 - Elsevier
Game semantics has renewed denotational semantics. It offers among other things an
attractive classification of programming features, and has brought a bunch of new …
attractive classification of programming features, and has brought a bunch of new …
Sequentiality vs. concurrency in games and logic
S Abramsky - Mathematical Structures in Computer Science, 2003 - cambridge.org
Sequentiality vs. concurrency in games and logic Page 1 Math. Struct. in Comp. Science (2003),
vol. 13, pp. 531–565. c 2003 Cambridge University Press DOI: 10.1017/S0960129503003980 …
vol. 13, pp. 531–565. c 2003 Cambridge University Press DOI: 10.1017/S0960129503003980 …