Lincoln, P., Mitchell, J.C., Scedrov, A., Shankar, N.: Decision problems for propositional linear logic. Annals of Pure and Applied Logic 56 (1992) 239--311 15  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
PAPER Special Section on Concurrent Systems Technology - Propositional Temporal Linear (Correct)
....states of a timed Petri net, t N. We can decide if S # [S# t . 5.2 The Decidability of Temporal Linear Logic Fragments In the remainder, we state with respect to the decidability of temporal linear logic fragments. The full fragment of propositional linear logic is known to be undecidable [13]. Obviously, the full fragment of propositional temporal linear logic is undecidable since it contains full fragment of propositional linear logic. A subsystem of linear logic without reusable modalities and is called the multiplicativeadditive fragment of linear logic (MALL) MALL is ....
....of propositional temporal linear logic is undecidable since it contains full fragment of propositional linear logic. A subsystem of linear logic without reusable modalities and is called the multiplicativeadditive fragment of linear logic (MALL) MALL is known to be PSPACE complete [13]. By Corollary 2.1, if a sequent without modalities is provable in TLL then it is provable in MALL. Since MALL is known to be decidable, a temporal linear logic sequent without modalities is also decidable. By Corollary 5.1, we can say that we can decide whether a sequent of the form (3.1) is ....
P.Lincoln, J.Mitchell, A.Scedrov and N.Shankar, "Decision problems for propositional linear logic," Annals of Pure and Applied Logic, vol. 56, pp.239--311, April 1992.
Decision Problems for Second-Order Linear Logic - Lincoln, Scedrov, Shankar (1995) (6 citations) Self-citation (Lincoln Scedrov Shankar) (Correct)
No context found.
P. D. Lincoln, J. C. Mitchell, A. Scedrov, and N. Shankar. Decision problems for propositional linear logic. Annals of Pure and Applied Logic, 56:239--311, 1992.
Decision Problems for Propositional Linear Logic - Patrick Lincoln John (1992) (67 citations) Self-citation (Lincoln Mitchell Scedrov Shankar) (Correct)
No context found.
P. Lincoln, J.C. Mitchell, A. Scedrov, and N. Shankar. Decision problems for propositional linear logic. In Proc. 31st IEEE Symp. on Foundations of Computer Science, pages 662--671, 1990.
Decision Problems for Propositional Linear Logic - Patrick Lincoln John (1992) (67 citations) Self-citation (Lincoln Mitchell Scedrov Shankar) (Correct)
No context found.
P. Lincoln, J.C. Mitchell, A. Scedrov, and N. Shankar. Decision problems for propositional linear logic. In Proc. 31st IEEE Symp. on Foundations of Computer Science, pages 662--671, 1990.
Decision Problems for Propositional Linear Logic - Patrick Lincoln John (1992) (67 citations) Self-citation (Lincoln Mitchell Scedrov Shankar) (Correct)
No context found.
P. Lincoln, J.C. Mitchell, A. Scedrov, and N. Shankar. Decision problems for propositional linear logic. In Proc. 31st IEEE Symp. on Foundations of Computer Science, pages 662--671, 1990.
Constant-Only Multiplicative Linear Logic is NP-Complete - Lincoln, Winkler (1992) (24 citations) Self-citation (Lincoln) (Correct)
No context found.
P. Lincoln, J. Mitchell, A. Scedrov, and N. Shankar. Decision problems for propositional linear logic. Annals Pure Appl. Logic, 56:239--311, 1992.
First Order Linear Logic without Modalities is NEXPTIME-Hard - Lincoln, Scedrov (1994) (9 citations) Self-citation (Lincoln Scedrov) (Correct)
No context found.
P. Lincoln, J. Mitchell, A. Scedrov, and N. Shankar. Decision problems for propositional linear logic. Annals Pure Appl. Logic, 56:239--311, 1992. Special Volume dedicated to the memory of John Myhill.
Proof Search in First-order Linear Logic and Other Cut-free.. - Lincoln, Shankar (1994) (22 citations) Self-citation (Lincoln Shankar) (Correct)
.... was previously used to analyze various fragments of propositional linear logic to show the undecidability of propositional linear logic, the pspace completeness of multiplicative additive linear logic (MALL) and the np completeness of multiplicative linear logic (MLL) with unrestricted weakening [10]. Using similar techniques, Kanovich showed that multiplicative linear logic is np complete [8] Lincoln and Winkler demonstrated np completeness of MLL using only the constants [13] Lincoln and Scedrov had previously shown this fragment of linear logic to be nexptime hard [11] By extending ....
P. Lincoln, J. Mitchell, A. Scedrov, and N. Shankar. Decision problems for propositional linear logic. Annals Pure Appl. Logic, 56:239-311, 1992. Special Volume dedicated to the memory of John Myhill.
A Focusing Inverse Method Theorem Prover for First-Order.. - Chaudhuri, Pfenning (2005) (Correct)
No context found.
Lincoln, P., Mitchell, J.C., Scedrov, A., Shankar, N.: Decision problems for propositional linear logic. Annals of Pure and Applied Logic 56 (1992) 239--311 15
A Logical Characterization of Forward and Backward.. - Chaudhuri, Pfenning.. (2006) (Correct)
No context found.
Patrick Lincoln, J. C. Mitchell, Andre Scedrov, and Natarajan Shankar. Decision problems for propositional linear logic. Annals of Pure and Applied Logic, 56:239--311, 1992.
Focusing the Inverse Method for Linear Logic - Chaudhuri, Pfenning (2005) (Correct)
No context found.
Patrick Lincoln, J. C. Mitchell, Andre Scedrov, and Natarajan Shankar. Decision problems for propositional linear logic. Annals of Pure and Applied Logic, 56:239--311, 1992.
A Focusing Inverse Method Theorem Prover for First-Order.. - Chaudhuri, Pfenning (2005) (Correct)
No context found.
Lincoln, P., Mitchell, J.C., Scedrov, A., Shankar, N.: Decision problems for propositional linear logic. Annals of Pure and Applied Logic 56 (1992) 239--311
Focusing the Inverse Method for Linear Logic - Chaudhuri, Pfenning (2005) (Correct)
No context found.
Lincoln, P., Mitchell, J.C., Scedrov, A., Shankar, N.: Decision problems for propositional linear logic. Annals of Pure and Applied Logic 56 (1992) 239--311
Linear Logic and Noncommutativity in the Calculus of Structures - Straßburger (2003) (Correct)
No context found.
P. Lincoln, J. Mitchell, A. Scedrov, and N. Shankar. Decision problems for propositional linear logic. Annals of Pure and Applied Logic, 56(1--3):239--311, 1992.
The Undecidability of System NEL - Straßburger (2003) (Correct)
No context found.
P. Lincoln, J. Mitchell, A. Scedrov, and N. Shankar. Decision problems for propositional linear logic. Annals of Pure and Applied Logic, 56(1--3):239--311, 1992.
System NEL is Undecidable - Straßburger (2003) (2 citations) (Correct)
No context found.
P. Lincoln, J. Mitchell, A. Scedrov, and N. Shankar. Decision problems for propositional linear logic. Annals of Pure and Applied Logic, 56(1--3):239--311, 1992.
A Non-commutative Extension of Multiplicative Exponential .. - Guglielmi, Straßburger (2004) (Correct)
No context found.
P. Lincoln, J. Mitchell, A. Scedrov, and N. Shankar. Decision problems for propositional linear logic. Annals of Pure and Applied Logic, 56(1--3):239--311, 1992.
System NEL is Undecidable - Straßburger (2003) (2 citations) (Correct)
No context found.
P. Lincoln, J. Mitchell, A. Scedrov, and N. Shankar. Decision problems for propositional linear logic. Annals of Pure and Applied Logic, 56(1--3):239--311, 1992.
A Non-commutative Extension of Multiplicative Exponential .. - Guglielmi, Straßburger (2004) (Correct)
No context found.
P. Lincoln, J. Mitchell, A. Scedrov, and N. Shankar. Decision problems for propositional linear logic. Annals of Pure and Applied Logic, 56(1--3):239--311, 1992.
The Undecidability of System NEL - Straßburger (2003) (Correct)
No context found.
P. Lincoln, J. Mitchell, A. Scedrov, and N. Shankar. Decision problems for propositional linear logic. Annals of Pure and Applied Logic, 56(1--3):239--311, 1992.
Linear Logic and Noncommutativity in the Calculus of Structures - Straßburger (2003) (21 citations) (Correct)
No context found.
P. Lincoln, J. Mitchell, A. Scedrov, and N. Shankar. Decision problems for propositional linear logic. Annals of Pure and Applied Logic, 56(1--3):239--311, 1992.
Appears in New Generation Computing, 15(4), 1997 - Static Analysis Of (1996) (Correct)
No context found.
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.
Bounded and Ordered Satisfiability: Connecting.. - Flouris, Lau.. (2003) (Correct)
No context found.
Lincoln, P., J. Mitchell, A. Scedrov, and N. Shankar (1990). Decision problems on propositional linear logic. In Proceedings of 31st Annual IEEE Symposium on the Foundations of Computer Science.
The Inverse Method for Intuitionistic Linear Logic (The.. - Chaudhuri (2003) (Correct)
No context found.
Patrick D. Lincoln, John C. Mitchell, Andre Scedrov, and Natarajan Shankar. Decision problems for propositional linear logic. Annals of Pure and Applied Logic, 56:239--311, 1992.
Temporal Linear Logic and Its Applications - Hirai (2000) (Correct)
No context found.
Patrick Lincoln, John Mitchell, Andre Scedrov, and Natarajan Shankar. Decision problems for propositional linear logic. Annals of Pure and Applied Logic, 56:239--311, April 1992.
First 50 documents Next 50
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