(Enter summary)
Abstract: Deep inference is a proof-theoretic notion in which proof rules apply
arbitrarily deeply inside a formula. We show that the essence of deep inference
is the bifunctoriality of the connectives. We demonstrate that, when given an inequational
theory that models cut-reduction, a deep inference calculus for classical
logic (SKSg) is a categorical model of the classical sequent calculus LK in the
sense of F uhrmann and Pym. We observe that this gives a notion of cut-reduction
for derivations... (Update)
Cited by: More
Categorical Models Of First-Order Classical Proofs - McKinley (2006)
(Correct)
Active bibliography (related documents): More All
0.8: Deep Inference Proof Theory Equals Categorical Proof Theory Minus .. - Hughes (2004)
(Correct)
0.3: Constructing free Boolean categories - Lamarche, al. (2005)
(Correct)
0.1: On the Axiomatisation of Boolean Categories with and without.. - Straßburger (2005)
(Correct)
Similar documents based on text: More All
0.3: Cut Elimination inside a Deep Inference System for Classical.. - Brünnler (2005)
(Correct)
0.2: A Deep Inference System for the Modal Logic S5 - Stouppa (2005)
(Correct)
0.2: Structures for Multiplicative Cyclic Linear Logic: Deepness.. - Di Gianantonio (2004)
(Correct)
Related documents from co-citation: More All
2: Natural deduction and coherence for weakly distributive categories
- Blute, Seely - 1991
BibTeX entry: (Update)
Richard M Kinley. Classical categories and deep inference. In Paola Bruscoli, Francois Lamarche, and Charles Stewart, editors, Structures and Deduction, pages 19--33. Technische Universitat Dresden, 2005. ISSN 1430-211X. http://citeseer.ist.psu.edu/kinley05classical.html More
@misc{ kinley05classical,
author = "R. Kinley",
title = "Classical categories and deep inference",
text = "Richard M Kinley. Classical categories and deep inference. In Paola Bruscoli,
Francois Lamarche, and Charles Stewart, editors, Structures and Deduction,
pages 19--33. Technische Universitat Dresden, 2005. ISSN 1430-211X.",
year = "2005",
url = "citeseer.ist.psu.edu/kinley05classical.html" }
Citations (may not include all citations):
268
Proofs and Types (context) - Girard, Lafont et al. - 1989
134
calculus: An algorithmic interpretation of classical natural.. (context) - Parigot - 1992
43
Weakly distributive categories
- Cockett, Seely - 1992
37
Natural deduction and coherence for weakly distributive cate..
- Blute, Cockett et al. - 1996
7
the semantics of classical disjunction (context) - Pym, Ritter - 2001
7
Proof Nets for Classical Logic (context) - Robinson - 2003
6
the Geometry of Interaction for Classical Logic (context) - uhrmann, Pym et al. - 2004
5
Order-enriched categorical models of the classical sequent c.. (context) - uhrmann, Pym - 2005
2
Deep Inference and Symmetry in Classical Proofs (context) - unnler - 2004
1
Atomic cut elimination for classical logic
- unnler - 2003
http://iccl.tu-dresden.de/
http://www.cs.bath.ac.uk/pym/
http://iccl.tu-dresden.de/guglielm/p/SystIntStr.pdf
http://alessio.guglielmi.name/res/cos/index.html
http://iccl.tu-dresden.de/
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