Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T22:36:55.150Z Has data issue: false hasContentIssue false

REPRESENTING CONJUNCTIVE DEDUCTIONS BY DISJUNCTIVE DEDUCTIONS

Published online by Cambridge University Press:  25 October 2016

KOSTA DOŠEN*
Affiliation:
Mathematical Institute SANU
ZORAN PETRIĆ*
Affiliation:
Mathematical Institute SANU
*
*MATHEMATICAL INSTITUTE SANU KNEZ MIHAILOVA 36, P.F. 367 11001 BELGRADE, SERBIA E-mail: kosta@mi.sanu.ac.rs
† MATHEMATICAL INSTITUTE SANU KNEZ MIHAILOVA 36, P.F. 367 11001 BELGRADE, SERBIA E-mail: zpetric@mi.sanu.ac.rs
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A skeleton of the category with finite coproducts ${\cal D}$ freely generated by a single object has a subcategory isomorphic to a skeleton of the category with finite products ${\cal C}$ freely generated by a countable set of objects. As a consequence, we obtain that ${\cal D}$ has a subcategory equivalent with ${\cal C}$ . 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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2016