(Enter summary)
Abstract: System BV is an extension of multiplicative linear logic (MLL) with the rules mix, nullary mix,
and a self-dual, non-commutative logical operator, called seq. While the rules mix and nullary mix
extend the deductive system, the operator seq extends the language of MLL. Due to the operator
seq, system
extends the applications of
MLL
to those where sequential composition is crucial,
e.g., concurrency theory. System FBV is an extension of MLL with the rules mix and nullary mix.
In this paper, ... (Update)
Cited by: More
Deep Inference and the Calculus of Structures - Guglielmi (2006)
(Correct)
Reducing Nondeterminism in the Calculus of Structures - Kahramanogullari
(Correct)
Reducing the Nondeterminism in the Calculus of Structures - Kahramanogullari (2005)
(Correct)
Active bibliography (related documents): More All
0.5: System BV is NP-complete - Kahramanogullari (2005)
(Correct)
0.2: A System of Interaction and Structure II: The Need for Deep.. - Tiu (2005)
(Correct)
0.1: A Non-commutative Extension of Multiplicative Exponential .. - Guglielmi, Straßburger (2004)
(Correct)
Similar documents based on text:
5.0: Unknown -
(Correct)
Related documents from co-citation: More All
5: A purely logical account of sequentiality in proof search
- Bruscoli - 2002
5: Non-commutativity and MELL in the calculus of structures
- Guglielmi, Straburger - 2001
5: A non-commutative extension of MELL
- Guglielmi, Straburger - 2002
BibTeX entry: (Update)
Ozan Kahramanogullar. System BV is NP-complete. In 12th Workshop on Logic, Language, Information and Computation (WoLLIC), ENTCS, 2005, to appear. http://citeseer.ist.psu.edu/kahramanogullari05system.html More
@misc{ kahramanogullar05system,
author = "O. Kahramanogullar",
title = "System BV is NP-complete",
text = "Ozan Kahramanogullar. System BV is NP-complete. In 12th Workshop on Logic,
Language, Information and Computation (WoLLIC), ENTCS, 2005, to appear.",
year = "2005",
url = "citeseer.ist.psu.edu/kahramanogullari05system.html" }
Citations (may not include all citations):
4212
Computer and Intractability: A Guide to Theory of NPComplete.. (context) - Garey, Johnson - 1979
1933
Communication and Concurrency (context) - Milner - 1989
982
Theoretical Computer Science (context) - Girard - 1987
39
Horn programming in linear logic is NP-complete (context) - Kanovich - 1992
39
Deep Inference and Symmetry in Classical Proofs (context) - Brunnler - 2003
38
A non-commutative extension of MELL
- Guglielmi, Straburger - 2002
35
Pomset logic: A non-commutative extension of classical linea..
- Retore - 1997
34
Constant-only multiplicative linear logic is NP-complete
- Lincoln, Winkler - 1994
31
Properties of a logical system in the calculus of structures
- Tiu - 2001
23
Technical Report WV (context) - Guglielmi, of - 2002
23
Linear Logic and Noncommutativity in the Calculus of Structu..
- Straburger - 2003
16
The multiplicative fragment of linear logic is NP-complete (context) - Kanovich - 1991
16
Pomset logic as a calculus of directed cographs
- Retore - 1999
7
Subnets of proof-nets in multiplicative linear logic with MI.. (context) - Bellin - 1997
1
System NEL is undecidable (context) - Straburger - 2003
1
ogical account of sequentiality in proof search (context) - Bruscoli, purely - 2002
Documents on the same site (http://alessio.guglielmi.name/res/cos/index.html): More
MELL in the Calculus of Structures - Straßburger (2003)
(Correct)
Implementing Deep Inference in TOM - Kahramanogullari, Moreau, Reilles (2005)
(Correct)
What is a Logic, and What is a Proof? - Straßburger (2005)
(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