Results 1  10
of
34
A system of interaction and structure
 ACM TRANSACTIONS ON COMPUTATIONAL LOGIC
, 2004
"... This paper introduces a logical system, called BV, which extends multiplicative linear logic by a noncommutative selfdual logical operator. This extension is particularly challenging for the sequent calculus, and so far it is not achieved therein. It becomes very natural in a new formalism, call ..."
Abstract

Cited by 87 (15 self)
 Add to MetaCart
This paper introduces a logical system, called BV, which extends multiplicative linear logic by a noncommutative selfdual logical operator. This extension is particularly challenging for the sequent calculus, and so far it is not achieved therein. It becomes very natural in a new formalism, called the calculus of structures, which is the main contribution of this work. Structures are formulae subject to certain equational laws typical of sequents. The calculus of structures is obtained by generalising the sequent calculus in such a way that a new topdown symmetry of derivations is observed, and it employs inference rules that rewrite inside structures at any depth. These properties, in addition to allowing the design of BV, yield a modular proof of cut elimination.
On the Proof Complexity of Deep Inference
, 2000
"... We obtain two results about the proof complexity of deep inference: 1) deepinference proof systems are as powerful as Frege ones, even when both are extended with the Tseitin extension rule or with the substitution rule; 2) there are analytic deepinference proof systems that exhibit an exponential ..."
Abstract

Cited by 31 (13 self)
 Add to MetaCart
We obtain two results about the proof complexity of deep inference: 1) deepinference proof systems are as powerful as Frege ones, even when both are extended with the Tseitin extension rule or with the substitution rule; 2) there are analytic deepinference proof systems that exhibit an exponential speedup over analytic Gentzen proof systems that they polynomially simulate.
Deep Sequent Systems for Modal Logic
 ARCHIVE FOR MATHEMATICAL LOGIC
"... We see a systematic set of cutfree axiomatisations for all the basic normal modal logics formed by some combination the axioms d,t,b,4, 5. They employ a form of deep inference but otherwise stay very close to Gentzen’s sequent calculus, in particular they enjoy a subformula property in the litera ..."
Abstract

Cited by 28 (4 self)
 Add to MetaCart
We see a systematic set of cutfree axiomatisations for all the basic normal modal logics formed by some combination the axioms d,t,b,4, 5. They employ a form of deep inference but otherwise stay very close to Gentzen’s sequent calculus, in particular they enjoy a subformula property in the literal sense. No semantic notions are used inside the proof systems, in particular there is no use of labels. All their rules are invertible and the rules cut, weakening and contraction are admissible. All systems admit a straightforward terminating proof search procedure as well as a syntactic cut elimination procedure.
Reducing Nondeterminism in the Calculus of Structures
, 2005
"... The calculus of structures is a proof theoretical formalism which generalizes the sequent calculus with the feature of deep inference: in contrast to the sequent calculus, inference rules can be applied at any depth inside a formula, bringing shorter proofs than all other formalisms supporting a ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
The calculus of structures is a proof theoretical formalism which generalizes the sequent calculus with the feature of deep inference: in contrast to the sequent calculus, inference rules can be applied at any depth inside a formula, bringing shorter proofs than all other formalisms supporting analytical proofs. However, deep applicability of inference rules causes greater nondeterminism than in the sequent calculus regarding proof search. In this paper, we introduce a new technique which reduces nondeterminism without breaking proof theoretical properties, and provides a more immediate access to shorter proofs. We present our technique on system BV, the smallest technically nontrivial system in the calculus of structures, extending multiplicative linear logic with the rules mix, nullary mix and a self dual, noncommutative logical operator. Since our technique exploits a scheme common to all the systems in the calculus of structures, we argue that it generalizes to these systems for classical logic, linear logic and modal logics.
System BV without the Equalities for Unit
, 2004
"... System BV is an extension of multiplicative linear logic with a noncommutative selfdual operator. In this paper we present systems equivalent to system BV where equalities for unit are oriented from left to right and new structural rules are introduced to preserve completeness. ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
System BV is an extension of multiplicative linear logic with a noncommutative selfdual operator. In this paper we present systems equivalent to system BV where equalities for unit are oriented from left to right and new structural rules are introduced to preserve completeness.
A system of interaction and structure II: the need for deep inference
 Logical Methods in Computer Science
, 2006
"... Vol. 2 (2:4) 2006, pp. 1–24 ..."
Implementing System BV of the Calculus of Structures in Maude
, 2004
"... System BV is an extension of multiplicative linear logic with a noncommutative selfdual operator. We first map derivations of system BV of the calculus of structures to rewritings in a term rewriting system modulo equality, and then express this rewriting system as a Maude system module. This r ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
System BV is an extension of multiplicative linear logic with a noncommutative selfdual operator. We first map derivations of system BV of the calculus of structures to rewritings in a term rewriting system modulo equality, and then express this rewriting system as a Maude system module. This results in an automated proof search implementation for this system, and provides a recipe for implementing existing calculus of structures systems for other logics. Our result is interesting from the view of applications, specially, where sequentiality is essential, e.g., planning and natural language processing. In particular, we argue that we can express plans as logical formulae by using the sequential operator of BV and reason on them in a purely logical way.
A system of interaction and structure IV: The exponentials
 IN THE SECOND ROUND OF REVISION FOR MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE
, 2007
"... We study some normalisation properties of the deepinference proof system NEL, which can be seen both as 1) an extension of multiplicative exponential linear logic (MELL) by a certain noncommutative selfdual logical operator; and 2) an extension of system BV by the exponentials of linear logic. T ..."
Abstract

Cited by 11 (6 self)
 Add to MetaCart
We study some normalisation properties of the deepinference proof system NEL, which can be seen both as 1) an extension of multiplicative exponential linear logic (MELL) by a certain noncommutative selfdual logical operator; and 2) an extension of system BV by the exponentials of linear logic. The interest of NEL resides in: 1) its being Turing complete, while the same for MELL is not known, and is widely conjectured not to be the case; 2) its inclusion of a selfdual, noncommutative logical operator that, despite its simplicity, cannot be axiomatised in any analytic sequent calculus system; 3) its ability to model the sequential composition of processes. We present several decomposition results for NEL and, as a consequence of those and via a splitting theorem, cut elimination. We use, for the first time, an induction measure based on flow graphs associated to the exponentials, which captures their rather complex behaviour in the normalisation process. The results are presented in the calculus of structures, which is the first, developed formalism in deep inference.
Cut Elimination inside a Deep Inference System for Classical Predicate Logic
, 2005
"... Deep inference is a natural generalisation of the onesided sequent calculus where rules are allowed to apply deeply inside formulas, much like rewrite rules in term rewriting. This freedom in applying inference rules allows to express logical systems that are di#cult or impossible to express in ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Deep inference is a natural generalisation of the onesided sequent calculus where rules are allowed to apply deeply inside formulas, much like rewrite rules in term rewriting. This freedom in applying inference rules allows to express logical systems that are di#cult or impossible to express in the cutfree sequent calculus and it also allows for a more finegrained analysis of derivations than the sequent calculus. However, the same freedom also makes it harder to carry out this analysis, in particular it is harder to design cut elimination procedures. In this paper we see a cut elimination procedure for a deep inference system for classical predicate logic.
System BV is NPcomplete
, 2005
"... System BV is an extension of multiplicative linear logic (MLL) with the rules mix, nullary mix, and a selfdual, noncommutative 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, syste ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
System BV is an extension of multiplicative linear logic (MLL) with the rules mix, nullary mix, and a selfdual, noncommutative 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 BV 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, by relying on the fact that system BV is a conservative extension of system FBV, I show that system BV is NPcomplete by encoding the 3Partition problem in FBV. I provide a simple completeness proof of this encoding by resorting to a novel proof theoretical method for reducing the nondeterminism in proof search, which is also of independent interest.