Show simple item record

Files in this item

Thumbnail
Name:
Syllogisms_BSL_2_.pdf
Size:
293.1Kb
Format:
PDF
View/Open

Indefinite proof and inversions of syllogisms

Item metadata

dc.contributor.authorDyckhoff, Roy
dc.date.accessioned2019-07-25T15:30:01Z
dc.date.available2019-07-25T15:30:01Z
dc.date.issued2019
dc.identifier255018325
dc.identifierece1adaf-6c7f-4f4f-b2bc-b6e410546473
dc.identifier85069643144
dc.identifier000477058600003
dc.identifier.citationDyckhoff , R 2019 , ' Indefinite proof and inversions of syllogisms ' , Bulletin of Symbolic Logic , vol. 25 , no. 2 , pp. 196-207 . https://doi.org/10.1017/bsl.2018.59en
dc.identifier.issn1079-8986
dc.identifier.urihttps://hdl.handle.net/10023/18167
dc.description.abstractBy considering the new notion of the inverses of syllogisms such as Barbara and Celarent, we show how the rule of Indirect Proof, in the form (no multiple or vacuous discharges) used by Aristotle, may be dispensed with, in a system comprising four basic rules of subalternation or conversion and six basic syllogisms.
dc.format.extent12
dc.format.extent300216
dc.language.isoeng
dc.relation.ispartofBulletin of Symbolic Logicen
dc.subjectDeductionen
dc.subjectSyllogismen
dc.subjectIndirect proofen
dc.subjectBC Logicen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectT-NDASen
dc.subject.lccBCen
dc.subject.lccQA75en
dc.titleIndefinite proof and inversions of syllogismsen
dc.typeJournal articleen
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.doi10.1017/bsl.2018.59
dc.description.statusPeer revieweden


This item appears in the following Collection(s)

Show simple item record

Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.