DC FieldValueLanguage
dc.contributor.authorBorisavljević, Mirjanaen_US
dc.contributor.authorDošen, Kostaen_US
dc.contributor.authorPetrić, Zoranen_US
dc.date.accessioned2020-07-13T12:03:29Z-
dc.date.available2020-07-13T12:03:29Z-
dc.date.issued2000-01-01-
dc.identifier.issn0960-1295-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/3808-
dc.description.abstractThis paper presents a cut-elimination procedure for intuitionistic propositional logic in which cut is eliminated directly, without introducing the multiple-cut rule mix, and in which pushing cut above contraction is one of the reduction steps. The presentation of this procedure is preceded by an analysis of Gentzen's mix-elimination procedure, made in the perspective of permuting cut with contraction. We also show that in the absence of implication, pushing cut above contraction does not pose problems for directly eliminating cut.en_US
dc.publisherCambridge University Pressen_US
dc.relation.ispartofMathematical Structures in Computer Scienceen_US
dc.titleOn permuting cut with contractionen_US
dc.typeArticleen_US
dc.identifier.doi10.1017/S0960129599003011-
dc.identifier.scopus2-s2.0-0038703124-
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Artsen_US
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.description.rankM23-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0003-2049-9892-
Show simple item record

SCOPUSTM   
Citations

10
checked on Nov 19, 2024

Page view(s)

19
checked on Nov 19, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.