Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorBobzien, Susanne
dc.contributor.authorDyckhoff, Roy
dc.date.accessioned2018-05-01T12:30:06Z
dc.date.available2018-05-01T12:30:06Z
dc.date.issued2019-04
dc.identifier.citationBobzien , S & Dyckhoff , R 2019 , ' Analyticity, balance and non-admissibility of Cut in Stoic Logic ' , Studia Logica , vol. 107 , no. 2 , pp. 375–397 . https://doi.org/10.1007/s11225-018-9797-5en
dc.identifier.issn0039-3215
dc.identifier.otherPURE: 252715248
dc.identifier.otherPURE UUID: 11389149-68f9-4c91-bbc4-b24a1ad6a8e3
dc.identifier.otherScopus: 85045728427
dc.identifier.otherWOS: 000461367400005
dc.identifier.urihttps://hdl.handle.net/10023/13269
dc.description.abstractThis paper shows that, for the Hertz-Gentzen Systems of 1933 (without Thinning), extended by a classical rule T1 (from the Stoics) and using certain axioms (also from the Stoics), all derivations are analytic: every cut formula occurs as a subformula in the cut’s conclusion. Since the Stoic cut rules are instances of Gentzen’s Cut rule of 1933, from this we infer the decidability of the propositional logic of the Stoics. We infer the correctness for this logic of a “relevance criterion” and of two “balance criteria”, and hence (in contrast to one of Gentzen’s 1933 results) that a particular derivable sequent has no derivation that is “normal” in the sense that the first premiss of each cut is cut-free. We also infer that Cut is not admissible in the Stoic system, based on the standard Stoic axioms, the T1 rule and the instances of Cut with just two antecedent formulae in the first premiss.
dc.format.extent23
dc.language.isoeng
dc.relation.ispartofStudia Logicaen
dc.rightsCopyright The Author(s) 2018. This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.en
dc.subjectSequenten
dc.subjectAnalyticityen
dc.subjectStoic logicen
dc.subjectProof theoryen
dc.subjectDecidabilityen
dc.subjectRelevanceen
dc.subjectBalanceen
dc.subjectCut-admissibilityen
dc.subjectBC Logicen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectT-NDASen
dc.subject.lccBCen
dc.subject.lccQA75en
dc.titleAnalyticity, balance and non-admissibility of Cut in Stoic Logicen
dc.typeJournal articleen
dc.description.versionPublisher PDFen
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen
dc.contributor.institutionUniversity of St Andrews. Centre for Interdisciplinary Research in Computational Algebraen
dc.identifier.doihttps://doi.org/10.1007/s11225-018-9797-5
dc.description.statusPeer revieweden


This item appears in the following Collection(s)

Show simple item record