![]() |
CiteULike | ![]() |
msakai's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Classical Categories and Deep Inferenceby: Richard Mckinley
|
Reviews
[Write a review of this article]
Notes for this article
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractDeep 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ührmann and Pym. We observe that this gives a notion of cut-reduction for derivations in SKSg, for which the usual notion of cut in SKSg is a special case. Viewing SKSg as a model of the sequent calculus uncovers new insights into the Craig interpolation lemma and intuitionistic provability.
BibTeX record
RIS record