Files in this item
Contraction-free sequent calculi in intuitionistic logic : a correction
Item metadata
dc.contributor.author | Dyckhoff, Roy | |
dc.date.accessioned | 2019-01-07T17:30:05Z | |
dc.date.available | 2019-01-07T17:30:05Z | |
dc.date.issued | 2018-12 | |
dc.identifier | 255018207 | |
dc.identifier | 19711f3a-e6e9-403d-b0cc-c4ed3f9be55c | |
dc.identifier | 85061932585 | |
dc.identifier | 000454236900021 | |
dc.identifier.citation | Dyckhoff , 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.38 | en |
dc.identifier.issn | 0022-4812 | |
dc.identifier.uri | https://hdl.handle.net/10023/16793 | |
dc.description.abstract | We 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.extent | 3 | |
dc.format.extent | 77466 | |
dc.language.iso | eng | |
dc.relation.ispartof | Journal of Symbolic Logic | en |
dc.subject | BC Logic | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject | T-NDAS | en |
dc.subject.lcc | BC | en |
dc.subject.lcc | QA75 | en |
dc.title | Contraction-free sequent calculi in intuitionistic logic : a correction | en |
dc.type | Journal article | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.doi | 10.1017/jsl.2018.38 | |
dc.description.status | Peer reviewed | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.