0

0

 Finite Sum - Product Logic
 摘  要: In this paper we describe a deductive system for categories with finite products and coproducts, prove decidability of equality of morphisms via cut elimina- tion, and prove a "Whitman theorem" for the free such categories over arbitrary base categories. This result provides a nice illustration of some basic techniques in categorical proof theory, and also seems to have slipped past unproved in previous work in this field. Furthermore, it suggests a type-theoretic approach to 2-player input-output games.
 发  表:

 论文统计图 .axis path, .axis line { fill: none; stroke: #000; shape-rendering: crispEdges; } .line { fill: none; stroke-width: 1.5px; }
 共享有10个版本  [展开全部版本] [收起版本] http://emis.bibl.cwi.nl/journals/TAC/volumes/8/n5/n5.pdf http://emis.dsd.sztaki.hu/journals/TAC/volumes/8/n5/n5.pdf http://emis.luc.ac.be/journals/TAC/volumes/8/n5/n5.pdf
 Bibtex @ARTICLE{author = {J. R. B. Cockett and R. A. G. Seely},title = {Finite Sum - Product Logic},journal = {Theory Appl. Categ},year = {2001},volume = {8},pages = {2001}}

 还没有人点评哦

 On the word problem for SP-categories, and the properties of two-way communication Preservation by fibring of the finite model property Unitary Theories, Unitary Categories Geometry of Interaction and the Dynamics of Proof Reduction: A Tutorial Concurrent Logic Games on Partial Orders Higher-order representation of substructural logics Physics, Topology, Logic and Computation: A Rosetta Stone Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic Bicartesian Coherence Revisited Linear logic as a tool for planning under temporal uncertainty