Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T05:18:48.367Z Has data issue: false hasContentIssue false

PEIRCE’S CALCULI FOR CLASSICAL PROPOSITIONAL LOGIC

Published online by Cambridge University Press:  29 October 2018

MINGHUI MA*
Affiliation:
Department of Philosophy, Sun Yat-Sen University
AHTI-VEIKKO PIETARINEN*
Affiliation:
Tallinn University of Technology; Nazarbayev University; and Higher School of Economics, National Research University
*
*DEPARTMENT OF PHILOSOPHY INSTITUTE FOR LOGIC AND COGNITION SUN YAT-SEN UNIVERSITY, GUANGZHOU XINGANG XI ROAD 135, HAIZHU DISTRICT GUANGZHOU 510275, CHINA E-mail: mamh6@mail.sysu.edu.cn
†TALLINN UNIVERSITY OF TECHNOLOGY, TALLINN NAZARBAYEV UNIVERSITY, ASTANA NATIONAL RESEARCH UNIVERSITY HIGHER SCHOOL OF ECONOMICS MOSCOW, RUSSIA E-mail: ahti-veikko.pietarinen@ttu.ee
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.

This article investigates Charles Peirce’s development of logical calculi for classical propositional logic in 1880–1896. Peirce’s 1880 work on the algebra of logic resulted in a successful calculus for Boolean algebra. This calculus, denoted by PC, is here presented as a sequent calculus and not as a natural deduction system. It is shown that Peirce’s aim was to present PC as a sequent calculus. The law of distributivity, which Peirce states in 1880, is proved using Peirce’s Rule, which is a residuation, in PC. The transitional systems of the algebra of the copula that Peirce develops since 1880 paved the way to the 1896 graphical system of the alpha graphs. It is shown how the rules of the alpha system reinterpret Boolean algebras, answering Peirce’s statement that logical graphs supply a new system of fundamental assumptions to logical algebra. A proof-theoretic analysis is given for the connection between PC and the alpha system.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2018