Paper Info
Title
The Maximality of Cartesian Categories
Abstract
It is proved that equations between arrows assumed for cartesian categories are maximal in the sense that extending them with any new equation in the language of free cartesian categories collapses a cartesian category into a preorder. An analogous result holds for categories with binary products, which may lack a terminal object. The proof is based on a coherence result for cartesian categories, which is related to model-theoretic methods of normalization. This maximality of cartesian categories, which is analogous to Post completeness, shows that the usual equivalence between deductions in conjunctive logic induced by beta eta normalization in natural deduction is chosen optimally. Mathematics Subject Classification: 18A30, 18D99, 18A15, 03F05, 03G30.
Year
DOI
Venue
2001
10.1002/1521-3870(200101)47:1<137::AID-MALQ137>3.0.CO;2-F
MATHEMATICAL LOGIC QUARTERLY
Keywords
DocType
Volume
cartesian categories,coherence,post completeness,conjunctive logic,natural deduction
Journal
47
Issue
ISSN
Citations 
1
0942-5616
4
PageRank 
References 
Authors
1.41
0
2
Name
Order
Citations
PageRank
Kosta Dosen114325.45
Zoran Petric24010.82