Results 1 
5 of
5
Classical categories and deep inference
"... Deep inference is a prooftheoretic notion in which proof rules apply arbitrarily deeply inside a formula. We show that the essense of deep inference is the bifunctorality of the connectives. We demonstrate that, when given an inequational theory that models cutreduction, a deep inference calculus ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Deep inference is a prooftheoretic notion in which proof rules apply arbitrarily deeply inside a formula. We show that the essense of deep inference is the bifunctorality of the connectives. We demonstrate that, when given an inequational theory that models cutreduction, a deep inference calculus for classical logic (SKSg) is a categorical model of the classical sequent calculus LK in the sense of Führmann and Pym. We uncover a mismatch between this notion of cutreduction and the usual notion of cut in SKSg. Viewing SKSg as a model of the sequent calculus uncovers new insights into the Craig interpolation lemma and intuitionistic provablility.
Proof nets for Herbrand’s Theorem
"... This paper explores Herbrand’s theorem as the source of a natural notion of abstract proof object for classical logic, embodying the “essence ” of a sequent calculus proof. We we see how to view a calculus of abstract Herbrand proofs (“Herbrand nets”) as an analytic proof system with syntactic cute ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
This paper explores Herbrand’s theorem as the source of a natural notion of abstract proof object for classical logic, embodying the “essence ” of a sequent calculus proof. We we see how to view a calculus of abstract Herbrand proofs (“Herbrand nets”) as an analytic proof system with syntactic cutelimination. Herbrand nets can also be seen as a natural generalization of Miller’s expansion tree proofs to a setting including cut. We demonstrate sequentialization of Herbrand nets into a sequent calculus LKH; each net corresponds to an equivalence class of LKH proofs under natural proof transformations. A surprising property of our cutreduction algorithm is that it is nonconfluent, despite not supporting the usual examples of nonconfluent reduction in classical logic.
Deep Inference and Probabilistic Coherence Spaces
, 2009
"... This paper proposes a definition of categorical model of the deep inference system BV, introduced by Guglielmi. Our definition is based on the notion of a linear functor, due to Cockett and Seely. A BVcategory is a linearly distributive category, possibly with negation, with an additional tensor pr ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
This paper proposes a definition of categorical model of the deep inference system BV, introduced by Guglielmi. Our definition is based on the notion of a linear functor, due to Cockett and Seely. A BVcategory is a linearly distributive category, possibly with negation, with an additional tensor product which, when viewed as a bivariant functor, is linear with a degeneracy condition. We show that this simple definition implies all of the key isomorphisms of the theory. We show that coherence spaces, with Retoré’s noncommutative tensor, is a model.We then consider Girard’s category of probabilistic coherence spaces and show that it contains a selfdual monoidal structure in addition to the ∗autonomous structure exhibited by Girard. This
Categories and Subject Descriptors: F4.1 [Mathematical logic and formal languages]: Mathematical
"... This paper explores Herbrand’s theorem as the source of a natural notion of abstract proof object for classical logic, embodying the “essence ” of a sequent calculus proof. We see how to view a calculus of abstract Herbrand proofs (“Herbrand nets”) as an analytic proof system with syntactic cutelim ..."
Abstract
 Add to MetaCart
This paper explores Herbrand’s theorem as the source of a natural notion of abstract proof object for classical logic, embodying the “essence ” of a sequent calculus proof. We see how to view a calculus of abstract Herbrand proofs (“Herbrand nets”) as an analytic proof system with syntactic cutelimination. Herbrand nets can also be seen as a natural generalization of Miller’s expansion tree proofs to a setting including cut. We demonstrate sequentialization of Herbrand nets into a sequent calculus LKH; each net corresponds to an equivalence class of LKH proofs under natural proof transformations. A surprising property of our cutreduction algorithm is that it is nonconfluent, despite not supporting the usual examples of nonconfluent reduction in classical logic.
Proof Theory of the Cut Rule
"... The cut rule is a very basic component of any sequentstyle presentation of a logic. This essay starts by describing the categorical proof theory of the cut rule in a calculus which allows sequents to have many formulas on the left but only one on the right of the turnstile. We shall assume a minimu ..."
Abstract
 Add to MetaCart
The cut rule is a very basic component of any sequentstyle presentation of a logic. This essay starts by describing the categorical proof theory of the cut rule in a calculus which allows sequents to have many formulas on the left but only one on the right of the turnstile. We shall assume a minimum of structural rules and connectives: in fact, we shall start with