The Herbrand Functional Interpretation of the Double Negation Shift
نویسندگان
چکیده
This paper considers a generalisation of selection functions over an arbitrary strong monad T , as functionals of type J RX = (X → R) → TX. It is assumed throughout that R is a T -algebra. We show that J R is also a strong monad, and that it embeds into the continuation monad KRX = (X → R) → R. We use this to derive that the explicitly controlled product of T -selection functions is definable from the explicitly controlled product of quantifiers, and hence from Spector’s bar recursion. We then prove several properties of this product in the special case when T is the finite power set monad Pf(·). These are used to show that when TX = Pf(X) the explicitly controlled product of T -selection functions calculates a witness to the Herbrand functional interpretation of the double negation shift.
منابع مشابه
The bounded functional interpretation of the double negation shift
We prove that the (non-intuitionistic) law of the double negation shift has a bounded functional interpretation with bar recursive functionals of finite type. As an application, we show that full numerical comprehension is compatible with the uniformities introduced by the characteristic principles of the bounded functional interpretation for the
متن کاملUnderstanding and Using Spector's Bar Recursive Interpretation of Classical Analysis
This note reexamines Spector’s remarkable computational interpretation of full classical analysis. Spector’s interpretation makes use of a rather abstruse recursion schema, so-called bar recursion, used to interpret the double negation shift DNS. In this note bar recursion is presented as a generalisation of a simpler primitive recursive functional needed for the interpretation of a finite (int...
متن کاملAn Almost Classical Logic for Logic Programming and Nonmonotonic Reasoning
The model theory of a first-order logic called N is introduced. N does not eliminate double negations, as classical logic does, but instead reduces fourfold negations. N is very close to classical logic: N has two truth values; implications are, in N like in classical logic, material; and negation distributes over compound formulas in N as it does in classical logic. Results suggest that the se...
متن کاملNegation and Constraint Logic Programming
Almost all constraint logic programming systems include negation, yet nowhere has a sound operational model for negation in CLP been discussed. The SLDNF approach of only allowing ground negative subgoals to execute is very restrictive in constraint logic programming where most variables appearing in a derivation never become ground. By describing a scheme for constructive negation in constrain...
متن کاملAn interpretation of the Sigma-2 fragment of classical Analysis in System T
We consider the Double-negation Shift (DNS) as a constructive principle in its own right and its effect on modified realizability (MR) and Dialectica (D) interpretations. We notice that DNS proves its own MR-interpretation, meaning that a priori one does not have to consider the more complex D-interpretation with Bar Recursion for interpreting Analysis. From the “with truth” variant of MR, we o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 82 شماره
صفحات -
تاریخ انتشار 2017