Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorDyckhoff, Roy
dc.date.accessioned2019-01-07T17:30:05Z
dc.date.available2019-01-07T17:30:05Z
dc.date.issued2018-12
dc.identifier.citationDyckhoff , R 2018 , ' Contraction-free sequent calculi in intuitionistic logic : a correction ' , Journal of Symbolic Logic , vol. 83 , no. 4 , pp. 1680-1682 . https://doi.org/10.1017/jsl.2018.38en
dc.identifier.issn0022-4812
dc.identifier.otherPURE: 255018207
dc.identifier.otherPURE UUID: 19711f3a-e6e9-403d-b0cc-c4ed3f9be55c
dc.identifier.otherScopus: 85061932585
dc.identifier.otherWOS: 000454236900021
dc.identifier.urihttps://hdl.handle.net/10023/16793
dc.description.abstractWe present a much-shortened proof of a major result (originally due to Vorob’ev) about intuitionistic propositional logic: in essence, a correction of our 1992 article, avoiding several unnecessary definitions
dc.format.extent3
dc.language.isoeng
dc.relation.ispartofJournal of Symbolic Logicen
dc.rights© 2018, Association for Symbolic Logic. This work has been made available online in accordance with the publisher's policies. This is the final published version of the work, which was originally published at https://doi.org/10.1017/jsl.2018.38en
dc.subjectBC Logicen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectT-NDASen
dc.subject.lccBCen
dc.subject.lccQA75en
dc.titleContraction-free sequent calculi in intuitionistic logic : a correctionen
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.1017/jsl.2018.38
dc.description.statusPeer revieweden


This item appears in the following Collection(s)

Show simple item record