Delimited control operators prove Double-negation Shift
Logic
2014-11-04 v2 Logic in Computer Science
Abstract
We propose an extension of minimal intuitionistic predicate logic, based on delimited control operators, that can derive the predicate-logic version of the Double-negation Shift schema, while preserving the disjunction and existence properties.
Keywords
Cite
@article{arxiv.1012.0929,
title = {Delimited control operators prove Double-negation Shift},
author = {Danko Ilik},
journal= {arXiv preprint arXiv:1012.0929},
year = {2014}
}