On Sets of Premises
Logic
2016-06-10 v7 Logic in Computer Science
Abstract
Conceiving of premises as collected into sets or multisets, instead of sequences, may lead to triviality for classical and intuitionistic logic in general proof theory, where we investigate identity of deductions. Any two deductions with the same premises and the same conclusions become equal. In terms of categorial proof theory, this is a consequence of a simple fact concerning adjunction with a full and faithful functor applied to the adjunction between the diagonal functor and the product biendofunctor, which corresponds to the conjunction connective.
Cite
@article{arxiv.1412.6783,
title = {On Sets of Premises},
author = {Kosta Dosen},
journal= {arXiv preprint arXiv:1412.6783},
year = {2016}
}
Comments
13 pages