Peirce's Sequent Proofs of Distributivity

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)

Abstract

The leading principle (Peirce's Rule) of Peirce's calculus {\bf PC} is that of residuation. Thus the law of distributivity, which Peirce states but does not prove in 1880, can be proved using the rule in {\bf PC}. We also give a shorter proof in his 1896 alpha system and remark on the main historical findings, including the fact that Peirce's preferred method was to present his PC as a sequent calculus.
Original languageEnglish
Pages (from-to)168--182
JournalLecture Notes in Computer Science
Volume10119
Publication statusPublished - 2017

Fingerprint Dive into the research topics of 'Peirce's Sequent Proofs of Distributivity'. Together they form a unique fingerprint.

Cite this