Yves Lafont  Home/Search
Context Related
Links: DBLP | lmd.univmrs.fr/pub/lafont...mall2.ps.Z 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: stanford.edu/~iliano/linear...llb (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Recently, Lincoln, Scedrov and Shankar showed that the multiplicative fragment of second order intuitionistic linear logic is undecidable, using an encoding of second order intuitionistic logic. Their argument applies to the multiplicative-additive fragment, but it does not work in the classical case, because second order classical logic is decidable. Here we show that the multiplicative-additive fragment of second order classical linear logic is also undecidable, using an encoding of... (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)
Active bibliography (related documents): More All
0.2: The Undecidability of Second Order Multiplicative Linear Logic - Yves Lafont Laboratoire (1996) (Correct)
0.2: The Undecidability of Second Order Linear Affine Logic - Kopylov (1995) (Correct)
0.2: Deciding Provability of Linear Logic Formulas - Lincoln (1994) (Correct)
Similar documents based on text: More All
0.3: Decision Problems for Second-Order Linear Logic - Lincoln, Scedrov, Shankar (1995) (Correct)
0.2: Concurrent Games and Full Completeness - Abramsky, Melliès (1998) (Correct)
0.2: Proof Search in First-order Linear Logic and Other Cut-free.. - Lincoln, Shankar (1994) (Correct)
Related documents from co-citation: More All
14: The undecidability of second order multiplicative linear logic - Lafont, Scedrov - 1996
13: Theoretical Computer Science (context) - Girard - 1987
13: Decision problems for propositional linear logic - Lincoln, Mitchell et al. - 1992
BibTeX entry: (Update)
Y. Lafont. The undecidability of second order linear logic without exponentials. To appear in Journal of Symbolic Logic. 1995. http://citeseer.ist.psu.edu/lafont95undecidability.html More
@article{ lafont96undecidability,
author = "Yves Lafont",
title = "The Undecidability of Second Order Linear Logic Without Exponentials",
journal = "The Journal of Symbolic Logic",
volume = "61",
number = "2",
pages = "541-548",
year = "1996",
url = "citeseer.ist.psu.edu/lafont95undecidability.html" }
Citations (may not include all citations):982 Theoretical Computer Science (context) - Girard - 1987 ACM
96 Decision Problems for Propositional Linear Logic - Lincoln, Mitchell et al. - 1992 DBLP
88 Linear logic : its syntax and semantics - Girard - 1995
63 A Brief Guide to Linear Logic - Scedrov - 1993 DBLP
43 Recursive unsolvability of Post's problem of `tag' and other.. (context) - Minsky - 1961
19 The undecidability of second order multiplicative linear log.. - Lafont, Scedrov - 1996 ACM DBLP
16 How to program an infinite abacus (context) - Lambek - 1961
15 Some syntactical observations on linear logic (context) - Schellinx - 1991 DBLP
12 The Direct Simulation of Minsky machines in Linear logic (context) - Kanovich - 1995 ACM
11 Decision Problems for Second Order Linear Logic - Lincoln, Scedrov et al. - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://theory.stanford.edu/~iliano/linearbib/llb.html): More
First Order Linear Logic without Modalities is NEXPTIME-Hard - Lincoln, Scedrov (1994) (Correct)
The Finite Model Property For Various Fragments Of Linear Logic - Lafont (1997) (Correct)
Linear Continuations - Filinski (1992) (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