Representing conjunctive deductions by disjunctive deductions

Abstract

A skeleton of the category with finite coproducts freely generated by a single object has a subcategory isomorphic to a skeleton of the category with finite products freely generated by a countable set of objects. As a consequence, we obtain that has a subcategory equivalent with . From a proof-theoretical point of view, this means that up to some identifications of formulae the deductions of pure conjunctive logic with a countable set of propositional letters can be represented by deductions in pure disjunctive logic with just one propositional letter. By taking opposite categories, one can replace coproduct by product, i.e., disjunction by conjunction, and the other way round, to obtain the dual results.