Stoic sequent logic and proof theory

Journal article

This paper contends that Stoic logic (i.e. Stoic analysis) deserves more attention from contemporary logicians. It sets out how, compared with contemporary propositional calculi, Stoic analysis is closest to methods of backward proof search for Gentzen-inspired substructural sequent logics, as they have been developed in logic programming and structural proof theory, and produces its proof search calculus in tree form. It shows how multiple similarities to Gentzen sequent systems combine with intriguing dissimilarities that may enrich contemporary discussion. Much of Stoic logic appears surprisingly modern: a recursively formulated syntax with some truth-functional propositional operators; analogues to cut rules, axiom schemata and Gentzen’s negation-introduction rules; an implicit variable-sharing principle and deliberate rejection of Thinning and avoidance of paradoxes of implication. These latter features mark the system out as a relevance logic, where the absence of duals for its left and right introduction rules puts it in the vicinity of McCall’s connexive logic. Methodologically, the choice of meticulously formulated meta-logical rules in lieu of axiom and inference schemata absorbs some structural rules and results in an economical, precise and elegant system that values decidability over completeness.

Authors: Bobzien, S

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Taylor and Francis
• Journal: History and Philosophy of Logic
• Volume: 40
• Issue: 3
• Pages: 234-265
• Publication date: 2019-03-29
• Acceptance date: 2019-02-04
• DOI: 10.1080/01445340.2019.1579624
• EISSN: 1464-5149
• ISSN: 0144-5340
• Language: English
• Keywords: FFR