Delimited control operators prove double-negation shift
D Ilik - Annals of Pure and Applied logic, 2012 - Elsevier
Annals of Pure and Applied logic, 2012•Elsevier
… 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. © 2011 Elsevier BV All rights reserved. …
We now define a calculus of proof-term annotations for the natural deduction system of MQC+,
a version of simply typed λ-calculus with constants for handling all logical connectives and
the delimited control operators, and then a reduction system for proof terms; the idea is that …
operators, that can derive the predicate-logic version of the double-negation shift schema, while
preserving the disjunction and existence properties. © 2011 Elsevier BV All rights reserved. …
We now define a calculus of proof-term annotations for the natural deduction system of MQC+,
a version of simply typed λ-calculus with constants for handling all logical connectives and
the delimited control operators, and then a reduction system for proof terms; the idea is that …
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.
Elsevier
以上显示的是最相近的搜索结果。 查看全部搜索结果