Results 1  10
of
31
Normalisation control in deep inference via atomic flows
, 2008
"... Abstract. We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomic flows that correspond to complex reductions on derivations. This allows us to prove, for propositional logic, a n ..."
Abstract

Cited by 23 (11 self)
 Add to MetaCart
Abstract. We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomic flows that correspond to complex reductions on derivations. This allows us to prove, for propositional logic, a new and very general normalisation theorem, which contains cut elimination as a special case. We operate in deep inference, which is more general than other syntactic paradigms, and where normalisation is more difficult to control. We argue that atomic flows are a significant technical advance for normalisation theory, because 1) the technique they support is largely independent of syntax; 2) indeed, it is largely independent of logical inference rules; 3) they constitute a powerful geometric formalism, which is more intuitive than syntax. 1.
Cirquent calculus deepened
, 2007
"... Cirquent calculus is a new prooftheoretic and semantic framework, whose main distinguishing feature is being based on circuitstyle structures (called cirquents), as opposed to the more traditional approaches that deal with treelike objects such as formulas, sequents or hypersequents. Among its ad ..."
Abstract

Cited by 12 (7 self)
 Add to MetaCart
Cirquent calculus is a new prooftheoretic and semantic framework, whose main distinguishing feature is being based on circuitstyle structures (called cirquents), as opposed to the more traditional approaches that deal with treelike objects such as formulas, sequents or hypersequents. Among its advantages are greater efficiency, flexibility and expressiveness. This paper presents a detailed elaboration of a deepinference cirquent logic, which is naturally and inherently resource conscious. It shows that classical logic, both syntactically and semantically, can be seen to be just a special, conservative fragment of this more general and, in a sense, more basic logic — the logic of resources in the form of cirquent calculus. The reader will find various arguments in favor of switching to the new framework, such as arguments showing the insufficiency of the expressive power of linear logic or other formulabased approaches to developing resource logics, exponential improvements over the traditional approaches in both representational and proof complexities offered by cirquent calculus (including the existence of polynomial size cut, substitution and extensionfree cirquent calculus proofs for the notoriously hard pigeonhole principle), and more. Among the main purposes of this paper is to provide an introductorystyle starting point for what, as the author wishes to hope, might have a chance to become a new line of research in proof theory — a proof theory based on circuits instead of formulas.
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.
Quasipolynomial normalisation in deep inference via atomic flows and threshold formulae
, 2009
"... ABSTRACT. Jeˇrábek showed that analytic propositionallogic deepinference proofs can be constructed in quasipolynomial time from nonanalytic proofs. In this work, we improve on that as follows: 1) we significantly simplify the technique; 2) our normalisation procedure is direct, i.e., it is interna ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
ABSTRACT. Jeˇrábek showed that analytic propositionallogic deepinference proofs can be constructed in quasipolynomial time from nonanalytic proofs. In this work, we improve on that as follows: 1) we significantly simplify the technique; 2) our normalisation procedure is direct, i.e., it is internal to deep inference. The paper is selfcontained, and provides a starting point and a good deal of information for tackling the problem of whether a polynomialtime normalisation procedure exists. 1.
A Quasipolynomial CutElimination Procedure in Deep Inference via Atomic Flows and Threshold Formulae
"... Jerábek showed in 2008 that cuts in propositionallogic deepinference proofs can be eliminated in quasipolynomial time. The proof is an indirect one relying on a result of Atserias, Galesi and Pudlák about monotone sequent calculus and a correspondence between this system and cutfree deepinference ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
Jerábek showed in 2008 that cuts in propositionallogic deepinference proofs can be eliminated in quasipolynomial time. The proof is an indirect one relying on a result of Atserias, Galesi and Pudlák about monotone sequent calculus and a correspondence between this system and cutfree deepinference proofs. In this paper we give a direct proof of Jeˇrábek’s result: we give a quasipolynomialtime cutelimination procedure in propositionallogic deep inference. The main new ingredient is the use of a computational trace of deepinference proofs called atomic flows, which are both very simple (they trace only structural rules and forget logical rules) and strong enough to faithfully represent the cutelimination procedure.
From deep inference to proof nets via cut elimination
 Jour. of Logic and Comp
"... This paper shows how derivations in the deep inference system SKS for classical propositional logic can be translated into proof nets. Since an SKS derivation contains more information about a proof than the corresponding proof net, we observe a loss of information which can be understood as “elimin ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
This paper shows how derivations in the deep inference system SKS for classical propositional logic can be translated into proof nets. Since an SKS derivation contains more information about a proof than the corresponding proof net, we observe a loss of information which can be understood as “eliminating bureaucracy”. Technically this is achieved by cut reduction on proof nets. As an intermediate step between the two extremes, SKS derivations and proof nets, we will see proof graphs representing derivations in “Formalism A”. 1
Breaking Paths in Atomic Flows for Classic Logic
, 2010
"... This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propositional logic. It is based on the recently introduced away from much of the typical bureaucracy of proofs. We make cruci ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propositional logic. It is based on the recently introduced away from much of the typical bureaucracy of proofs. We make crucial use of the path breaker, an atomicflow construction that avoids some nasty termination problems, and that can be used in any proof system with sufficient symmetry. This paper contains an original 2dimensionaldiagram exposition of atomic flows, which helps us to connect atomic flows with other known formalisms.
A system of interaction and structure V: The exponentials and splitting
, 2009
"... System NEL is the mixed commutative/noncommutative linear logic BV augmented with linear logic’s exponentials, or, equivalently, it is MELL augmented with the noncommutative selfdual connective seq. System NEL is Turingcomplete, it is able to directly express process algebra sequential compositio ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
System NEL is the mixed commutative/noncommutative linear logic BV augmented with linear logic’s exponentials, or, equivalently, it is MELL augmented with the noncommutative selfdual connective seq. System NEL is Turingcomplete, it is able to directly express process algebra sequential composition and it faithfully models causal quantum evolution. In this paper, we show cut elimination for NEL, based on a property that we call splitting. NEL is presented in the calculus of structures, which is a deepinference formalism, because no Gentzen formalism can express it analytically. The splitting theorem shows how and to what extent we can recover a sequentlike structure in NEL proofs. Together with the decomposition theorem, proved in the previous paper of the series, this immediately leads to a cutelimination theorem for NEL. 1
ON THE AXIOMATISATION OF BOOLEAN CATEGORIES WITH AND WITHOUT MEDIAL
"... should be used for describing an object that ..."
Complexity of deep inference via atomic flows
, 2012
"... Abstract. We consider the fragment of deep inference free of compression mechanisms and compare its proof complexity to other systems, utilising ‘atomic flows’ to examine size of proofs. Results include a simulation of Resolution and daglike cutfree Gentzen, as well as a separation from boundedde ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Abstract. We consider the fragment of deep inference free of compression mechanisms and compare its proof complexity to other systems, utilising ‘atomic flows’ to examine size of proofs. Results include a simulation of Resolution and daglike cutfree Gentzen, as well as a separation from boundeddepth Frege. 1