See this document in CiteSeerX!

Decision Problems for Propositional Linear Logic (1990)  (Make Corrections)  (96 citations)
Patrick Lincoln, John Mitchell, Andre Scedrov, Natarajan Shankar
Proceedings 31st Annual IEEE Symp.\ on Foundations of Computer Science, FOCS'90, St Louis, Missouri, USA, 22--24 Oct 1990



  Home/Search   Context   Related

 
View or download:
sri.com/~lincoln/papers/focs90.ps.gz
sri.com/users/lincoln/pa...focs90.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  sri.com/~lincoln...lincolnpapers (more)
Homepages:  P.Lincoln  

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Linear logic, introduced by Girard, is a refinement of classical logic with a natural, intrinsic accounting of resources. We show that unlike most other propositional (quantifier-free) logics, full propositional linear logic is undecidable. Further, we prove that without the modal storage operator, which indicates unboundedness of resources, the decision problem becomes pspace-complete. We also establish membership in np for the multiplicative fragment, np-completeness for the multiplicative... (Update)

Cited by:   More
A Focusing Inverse Method Theorem Prover for First-Order.. - Chaudhuri, Pfenning (2005)   (Correct)
A Logical Characterization of Forward and Backward.. - Chaudhuri, Pfenning.. (2006)   (Correct)
Focusing the Inverse Method for Linear Logic - Chaudhuri, Pfenning (2005)   (Correct)

Similar documents (at the sentence level):
25.5%:   Decision Problems for Propositional Linear Logic - Lincoln, Mitchell, Scedrov.. (1994)   (Correct)
7.2%:   A Brief Guide to Linear Logic - Scedrov (1993)   (Correct)

Active bibliography (related documents):   More   All
0.7:   Linear Logic - Lincoln (1992)   (Correct)
0.3:   Applications of Linear Logic to Computation: An Overview - Alexiev (1993)   (Correct)
0.3:   Deciding Provability of Linear Logic Formulas - Lincoln (1994)   (Correct)

Similar documents based on text:   More   All
0.7:   The Undecidability of Second Order Multiplicative Linear Logic - Yves Lafont Laboratoire (1996)   (Correct)
0.3:   Seminar on Linear Logic and Application - Suggested Topics - Pfenning, al.   (Correct)
0.3:   The Additive Multiboxes - de Falco (2000)   (Correct)

Related documents from co-citation:   More   All
74:   Theoretical Computer Science (context) - Girard - 1987
33:   Logic programming in a fragment of intuitionistic linear logic - Hodas, Miller - 1994
25:   Logic programming with focusing proofs in linear logic - Andreoli - 1992

BibTeX entry:   (Update)

P. Lincoln, J. Mitchell, A. Scedrov, and N. Shankar. Decision problems for propositional linear logic. Annals of Pure and Applied Logic, 56:239--311, 1992. http://citeseer.ist.psu.edu/article/lincoln90decision.html   More

@incollection{ lincoln90decision,
    author = "Patrick Lincoln and John Mitchell and Andre Scedrov and Natarajan Shankar",
    title = "Decision Problems for Propositional Linear Logic",
    booktitle = "Proceedings 31st Annual {IEEE} Symp.\ on Foundations of Computer Science, {FOCS}'90, St Louis, Missouri, {USA}, 22--24 Oct 1990",
    publisher = "IEEE Computer Society Press",
    address = "Los Alamitos, CA",
    pages = "662--671",
    year = "1990",
    url = "citeseer.ist.psu.edu/article/lincoln90decision.html" }
Citations (may not include all citations):
4212   Computers and Intractability: A Guide to the Theory of NPCom.. (context) - Garey, Johnson - 1979
982   Theoretical Computer Science (context) - Girard - 1987
291   Theoretical Computer Science (context) - Lafont, abstract - 1988
248   The mathematics of sentence structure (context) - Lambek - 1958
223   Linear objects: Logical processes with built-in inheritance - Andreoli, Pareschi - 1990
109   Interaction nets (context) - Lafont - 1990
103   An algorithm for the general Petri net reachability problem (context) - Mayr - 1981
96   Decision problems for propositional linear logic - Lincoln, Mitchell et al. - 1990
77   The complexity of the word problems for commutative semigrou.. (context) - Mayr, Meyer - 1982
72   Archive for Mathematical Logic (context) - Danos, Regnier et al. - 1989
68   Towards a geometry of interaction (context) - Girard - 1989
53   Decidability of reachability in vector addition systems (context) - Kosaraju - 1982
47   Introduction to Combinators and Lambda Calculus (context) - Hindley, Seldin - 1986
35   Normal process representatives (context) - Gehlot, Gunter - 1990
33   From Petri nets to linear logic (context) - Marti-Oliet, Meseguer - 1989
32   Single-threaded polymorphic lambda calculus (context) - Guzman, Hudak - 1990
32   Petri nets as models of linear logic - Engberg, Winskel - 1990
26   A decidable fragment of predicate calculus (context) - Ketonen, Weyhrauch - 1984
25   Nets as tensor theories (context) - Gunter, Gehlot - 1989
19   A linear semantics for allowed logic programs (context) - Cerrito - 1990
19   proofs as computations (context) - Asperti, Ferrari et al. - 1990
16   Mechanizing Proof Theory: Resource-Aware Logics and Proof-Tr.. (context) - Bellin - 1990
16   Connection graphs (context) - Bawden - 1986
13   Dipartimento di Informatica (context) - Asperti, for et al. - 1987
11   and process semantics (context) - Abramsky, Vickers et al. - 1990
10   Theoretical Computer Science (context) - McAloon, large - 1984
10   Rendiconti del Seminario Matematico dell' Universit'a e Poli.. (context) - Girard - 1987
9   the finite containment problem for Petri nets (context) - Clote - 1986
8   Collected Works (context) - Gentzen - 1969
7   Edition Francaise de Scientific American (context) - Girard, lin'eaire et al. - 1990
6   The reachability problem is exponentialspace hard (context) - Lipton - 1976
5   Cambrige Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1989



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www2.csl.sri.com/~lincoln/lincoln-papers.html):   More
A Formally Verified Algorithm for Interactive Consistency.. - Lincoln, Rushby (1993)   (Correct)
Simulation and Performance Estimation for the Rewrite Rule.. - Hitoshi Aida (1992)   (Correct)
A Probabilistic Poly-Time Framework for Protocol Analysis - Lincoln, Mitchell.. (1998)   (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