See this document in CiteSeerX!

A PSPACE-complete fragment of Second Order Linear Logic (1999)  (Make Corrections)  
G. Perrier
Theoretical Computer Science



  Home/Search   Context   Related

 
View or download:
loria.fr/~perrier/tcs99.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  loria.fr/~perrier/papers (more)
(Enter author homepages)

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

Abstract: Existentially quantified variables are the source of non decidability for second order linear logic without exponentials (MALL2). We present a decision procedure for a fragment of MALL2 based on a canonical instantiation of these variables and using inference permutability in proofs. We also establish that this fragment is PSPACE-complete. Introduction The decision problem for second order linear logic without exponentials (MALL2) has given rise recently to many papers and results. P.... (Update)

Similar documents (at the sentence level):
15.1%:   A decidable fragment of Second Order Linear Logic - Perrier (1997)   (Correct)

Active bibliography (related documents):   More   All
0.4:   Categorial Type Logics - Moortgat (1997)   (Correct)
0.3:   Logical Aspects of Computational Linguistics: an.. - Blackburn, Dymetman.. (1997)   (Correct)
0.1:   The Undecidability of Second Order Linear Affine Logic - Kopylov (1995)   (Correct)

Similar documents based on text:   More   All
0.3:   Labelled Proof Nets for the Syntax and Semantics of Natural.. - Perrier (1999)   (Correct)
0.2:   The Undecidability of Second Order Multiplicative Linear Logic - Yves Lafont (1996)   (Correct)
0.2:   Decision Problems for Second-Order Linear Logic - Lincoln, Scedrov, Shankar (1995)   (Correct)

BibTeX entry:   (Update)

@article{ perrier99pspacecomplete,
    author = "G. Perrier",
    title = "A {PSPACE}-complete fragment of second-order linear logic",
    journal = "Theoretical Computer Science",
    volume = "224",
    number = "1--2",
    pages = "267--289",
    year = "1999",
    url = "citeseer.ist.psu.edu/perrier99pspacecomplete.html" }
Citations (may not include all citations):
142   Logic programming with focusing proofs in linear logic - Andreoli - 1992
96   Decision Problems for Propositional Linear Logic - Lincoln, Mitchell et al. - 1990
30   Games Semantics for Full Propositional Linear logic (context) - Lamarche - 1995
20   Foundations of proof search strategies design in linear logi.. - Galmiche, Perrier - 1994
19   The undecidability of second order linear logic without expo.. - Lafont
19   The undecidability of second order multiplicative linear log.. - Lafont, Scedrov - 1995
15   On proof normalisation in linear logic (context) - Galmiche, Perrier - 1994
11   Parsing with Polymorphism (context) - Emms - 1993
11   Decision problems for second order linear logic - Lincoln, Scedrov et al. - 1995
4   An undecidability result for polymorphic Lambek calculus (context) - Emms - 1995

Documents on the same site (http://www.loria.fr/~perrier/papers.html):   More
Foundations of Proof Search Strategies Design in Linear Logic - Galmiche, Perrier (1994)   (Correct)
A decidable fragment of Second Order Linear Logic - Perrier (1997)   (Correct)
Corrigendum to Galmiche's and Perrier's "On Proof Normalization.. - Perrier   (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