Article ID Journal Published Year Pages File Type
439340 Theoretical Computer Science 2006 20 Pages PDF
Abstract

We investigate semantics for classical proof based on the sequent calculus. We show that the propositional connectives are not quite well-behaved from a traditional categorical perspective, and give a more refined, but necessarily complex, analysis of how connectives may be characterised abstractly. Finally we explain the consequences of insisting on more familiar categorical behaviour.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics