Delimited control operators prove double-negation shift

DOI10.1016/j.apal.2011.12.008zbMath1251.03033arXiv1012.0929OpenAlexW1491272572MaRDI QIDQ450950

Danko Ilik

Publication date: 26 September 2012

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1012.0929

zbMATH Keywords

disjunction propertyintermediate logicexistence propertydelimited control operatorsdouble-negation shiftextension of minimal intuitionistic predicate logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Metamathematics of constructive systems (03F50) Subsystems of classical logic (including intuitionistic logic) (03B20) Intermediate logics (03B55)

Related Items (6)

Unnamed Item ⋮ An intuitionistic formula hierarchy based on high‐school identities ⋮ Unnamed Item ⋮ Delimited control operators prove double-negation shift ⋮ On the unification of classical, intuitionistic and affine logics ⋮ Minimum classical extensions of constructive theories

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Delimited control operators prove double-negation shift
• Lectures on the Curry-Howard isomorphism
• A type-theoretic foundation of delimited continuations
• Constructivism in mathematics. An introduction. Volume I
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• An introduction to Landin's ``A generalization of jumps and labels
• A generalization of jumps and labels
• On the unity of duality
• Extensional Gödel functional interpretation. A consistency proof of classical analysis
• Realizability algebras II : new models of ZF + DC
• A Constructive Proof of Dependent Choice, Compatible with Classical Logic
• Realizability algebras: a program to well order R
• Polymorphic Delimited Continuations
• A Substructural Type System for Delimited Continuations
• Representing Control: a Study of the CPS Transformation
• Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
• Intuitionistische Untersuchungen der formalistischen Logik
• On the concepts of completeness and interpretation of formal systems
• A Functional calculus of first order based on strict implication
• The deduction theorem in a functional calculus of first order based on strict implication
• Logical Approaches to Computational Barriers
• Typed lambda-calculus in classical Zermelo-Fraenkel set theory

This page was built for publication: Delimited control operators prove double-negation shift