(Enter summary)
Abstract: Linear logic was introduced by Girard in 1987 [30] both as a "logic behind logics", and as a "resource conscious logic". This thesis investigates computational aspects of linear logic. The main results of this work support the proposition that linear logic is a computational logic behind logics. This thesis augments the proof theoretic framework of linear logic by providing theorems such as permutability, impermutability, and cut-normalization with non-logical theories. On this expanded proof... (Update)
Context of citations to this paper: More
.... this is related with Girard s concept of polarity even though Abramsky has a slightly different interpretation, which is similar to [Pat92]) This implies that the games itself will be either positive or negative (in the sense described above) Eventually, plays are...
.... are used to give control over the shape of linear logic proofs, thus enabling a more direct computational reading, see Lincoln [28], Andreoli [5] Hodas and Miller [20] and Lincoln and Scedrov [24] The expressiveness of linear logic proof search as a computational...
Cited by: More
Constant-Only Multiplicative Linear Logic is NP-Complete - Lincoln, Winkler (1992)
(Correct)
First Order Linear Logic without Modalities is NEXPTIME-Hard - Lincoln, Scedrov (1994)
(Correct)
Agents via Mixed-mode Computation in Linear Logic - Harland, Winikoff (2004)
(Correct)
Active bibliography (related documents): More All
0.5: Deciding Provability of Linear Logic Formulas - Lincoln (1994)
(Correct)
0.5: Operational Aspects of Linear Lambda Calculus - Lincoln (1992)
(Correct)
0.1: Ordered Linear Logic Programming - Polakow, Pfenning (1998)
(Correct)
Similar documents based on text: More All
0.5: Deciding a Class of Path Formuals for Conflict-Free Petri Nets - Yen, Wang, Yang (1993)
(Correct)
0.4: Inductive Methods and Contract-Signing Protocols - Chadha, Kanovich, Scedrov (2001)
(Correct)
0.3: On NP-completeness in Linear Logic - Kopylov (1994)
(Correct)
Related documents from co-citation: More All
14: Theoretical Computer Science (context) - Girard - 1987
12: Linear Objects: Logical Processes with Built-in Inheritance
- Pareschi
9: Decision problems for propositional linear logic
- Lincoln, Mitchell et al. - 1992
BibTeX entry: (Update)
P.D. Lincoln. Computational Aspects of Linear Logic. PhD thesis, Stanford University, 1992. http://citeseer.ist.psu.edu/lincoln92computational.html More
@book{ patrick95computational,
author = "Lincoln, Patrick.",
title = "Computational Aspects of Linear Logic",
publisher = "MIT Press",
isbn = "0262121956",
year = "1995",
url = "citeseer.ist.psu.edu/lincoln92computational.html" }
Citations (may not include all citations):
142
Logic programming with focusing proofs in linear logic
- Andreoli - 1991
50
New foundations for the geometry of interaction
- Abramsky, Jagadeesan - 1992
13
Linear objects: Logical processes with builtin inheritance (context) - Andreoli, Pareschi - 1990
13
Dipartimento di Informatica (context) - Asperti, for et al.
6
Sequent calculus for intuitionistic linear propositional log.. (context) - Abrusci
2
Lecture Notes from Tutorial at ILPS (context) - Abramsky, linear - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.jussieu.fr/~fermigie/fermivista/ftp/theory.stanford.edu.html): More
Partial Orderings of Event Sets and Their.. - Luckham, Vera.. (1992)
(Correct)
Classes = Objects + Data Abstraction - Fisher
(Correct)
An Efficient System For Geometric Assembly.. - Romney, Godard.. (1995)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC