Computer Science – Logic in Computer Science
Scientific paper
2005-12-22
Computer Science
Logic in Computer Science
66 pages LaTeX, using TAC style, v3: minor changes as requested by the referee
Scientific paper
The term ``Boolean category'' should be used for describing an object that is to categories what a Boolean algebra is to posets. More specifically, a Boolean category should provide the abstract algebraic structure underlying the proofs in Boolean Logic, in the same sense as a Cartesian closed category captures the proofs in intuitionistic logic and a *-autonomous category captures the proofs in linear logic. However, recent work has shown that there is no canonical axiomatisation of a Boolean category. In this work, we will see a series (with increasing strength) of possible such axiomatisations, all based on the notion of *-autonomous category. We will particularly focus on the medial map, which has its origin in an inference rule in KS, a cut-free deductive system for Boolean logic in the calculus of structures. Finally, we will present a category of proof nets as a particularly well-behaved example of a Boolean category.
No associations
LandOfFree
On the Axiomatisation of Boolean Categories with and without Medial does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Axiomatisation of Boolean Categories with and without Medial, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Axiomatisation of Boolean Categories with and without Medial will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-726191