Name
Abstract | ||
|---|---|---|
The description of resources in game semantics has never achieved the simplicity and precision of linear logic, because of the misleading conception that linear logic is more primitive than game semantics. Here, we defend the opposite view, and thus advocate that game semantics is conceptually more primitive than linear logic. This revised point of view leads us to introduce tensor logic, a primitive variant of linear logic where negation is not involutive. After formulating its categorical semantics, we interpret tensor logic in a model based on Conway games equipped with a notion of payoff, in order to reflect the various resource policies of the logic: linear, affine, relevant or exponential. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.apal.2009.07.018 | Annals of Pure and Applied Logic |
Keywords | Field | DocType |
68Q55,03F52,18C50 | Discrete mathematics,Computational logic,Autoepistemic logic,Algebra,Computer science,Substructural logic,Multimodal logic,Philosophy of logic,Game semantics,Many-valued logic,Higher-order logic | Journal |
Volume | Issue | ISSN |
161 | 5 | 0168-0072 |
Citations | PageRank | References |
17 | 0.94 | 22 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paul-andré Melliès | 1 | 392 | 30.70 |
| Nicolas Tabareau | 2 | 241 | 23.63 |