Delimited control operators prove Double-negation Shift

Danko Ilik 1, 2, 3
2 PI.R2 - Design, study and implementation of languages for proofs and programs
PPS - Preuves, Programmes et Systèmes, Inria Paris-Rocquencourt, UPD7 - Université Paris Diderot - Paris 7, CNRS - Centre National de la Recherche Scientifique : UMR7126
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.
Liste complète des métadonnées

https://hal.inria.fr/hal-00647389
Contributor : Danko Ilik <>
Submitted on : Friday, December 2, 2011 - 12:21:27 AM
Last modification on : Friday, April 12, 2019 - 2:46:04 PM
Document(s) archivé(s) le : Saturday, March 3, 2012 - 2:25:07 AM

Files

article.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

Danko Ilik. Delimited control operators prove Double-negation Shift. Annals of Pure and Applied Logic, Elsevier Masson, 2012, Kurt Goedel Research Prize Fellowships 2010, 163 (11), pp.1549-1559. ⟨10.1016/j.apal.2011.12.008⟩. ⟨hal-00647389⟩

Share

Metrics

Record views

961

Files downloads

417