Delimited control operators prove Double-negation Shift
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.
Origin | Publisher files allowed on an open archive |
---|