Yves Lafont Laboratoire de Math'ematiques Discr`etes, UPR 9016 du CNRS, 163...  Home/Search
Context Related
| upenn.edu/pub/papers/scedrov...mrs.ps.Z upenn.edu/pub/papers/scedrov/mll2.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: upenn.edu/~scedro...recent_papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The multiplicative fragment of second order propositional linear logic is shown to be undecidable. Introduction Decision problems for propositional (quantifier-free) linear logic were first studied by Lincoln et al. [LMSS]. In referring to linear logic fragments, let M stand for multiplicatives, A for additives, E for exponentials (or modalities), 1 for first order quantifiers, 2 for second order propositional quantifiers, and I for "intuitionistic" version. In [LMSS] it was shown that full... (Update)
Cited by: More
Linear Logic and Noncommutativity in the Calculus of Structures - Straßburger (2003) (Correct)
The Undecidability of System NEL - Straßburger (2003) (Correct)
System NEL is Undecidable - Straßburger (2003) (Correct)
Similar documents (at the sentence level):
60.8%: The Undecidability of Second Order Multiplicative Linear Logic - Yves Lafont Laboratoire (1996) (Correct)
Active bibliography (related documents): More All
0.2: The Undecidability Of Second Order Linear Logic Without.. - Lafont (1995) (Correct)
0.2: Decision Problems for Second-Order Linear Logic - Lincoln, Scedrov, Shankar (1995) (Correct)
0.2: Deciding Provability of Linear Logic Formulas - Lincoln (1994) (Correct)
Similar documents based on text: More All
0.3: Decidability of Linear Affine Logic - Kopylov (1995) (Correct)
0.2: Recursive Inseparability In Linear Logic - Stal Aanderaa University (Correct)
0.2: Provability in TBLL: A Decision Procedure - Chirimar, Lipton (1993) (Correct)
Related documents from co-citation: More All
16: Theoretical Computer Science (context) - Girard - 1987
15: Decision problems for propositional linear logic - Lincoln, Mitchell et al. - 1992
14: The undecidability of second order linear logic without exponentials - Lafont - 1995
BibTeX entry: (Update)
Y. Lafont and A. Scedrov. The undecidability of second order multiplicative linear logic. Information and Computation, 125(1):46--51, 1996. http://citeseer.ist.psu.edu/article/lafont96undecidability.html More
@article{ lafont96undecidability,
author = "Yves Lafont and Andre Scedrov",
title = "The Undecidability of Second Order Multiplicative Linear Logic",
journal = "Information and Computation",
volume = "125",
number = "1",
pages = "46-51",
year = "1996",
url = "citeseer.ist.psu.edu/article/lafont96undecidability.html" }
Citations (may not include all citations):242 Linear logic (context) - Girard - 1987
96 Decision Problems for Propositional Linear Logic - Lincoln, Mitchell et al. - 1992
88 Linear logic: its syntax and semantics - Girard - 1995
63 A Brief Guide to Linear Logic - Scedrov - 1993
43 Recursive unsolvability of Post's problem of `tag' and other.. (context) - Minsky - 1961
34 Constant-Only Multiplicative Linear Logic is NPComplete - Lincoln, Winkler - 1994
26 Proof Search in First-Order Linear Logic and Other Cut-Free .. - Lincoln, Shankar - 1994
21 First Order Linear Logic Without Modalities is NEXPTIME-Hard - Lincoln, Scedrov - 1994
19 The undecidability of second order linear logic without expo.. - Lafont - 1995
19 The complexity of Horn fragments of linear logic (context) - Kanovich - 1994
16 How to program an infinite abacus (context) - Lambek - 1961
12 The Direct Simulation of Minsky machines in Linear logic (context) - Kanovich - 1995
11 Decision Problems for Second Order Linear Logic - Lincoln, Scedrov et al. - 1995
5 ese de Doctorat, Universit (context) - Amiot - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cis.upenn.edu/~scedrov/recent_papers.html): More
Phase Semantics for Light Linear Logic - Kanovich, Okada, Scedrov (1997) (Correct)
Optimization Complexity of Linear Logic Proof Games - Lincoln, Mitchell, Scedrov (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