Advertisement

Relating Classical Realizability and Negative Translation for Existential Witness Extraction

  • Alexandre Miquel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5608)

Abstract

Friedman showed how to turn a classical proof of a \(\Sigma^0_1\) formula into an intuitionistic proof of the same formula, thus giving an effective method to extract witnesses from classical proofs of such formulae. In this paper we show how to achieve the same goal efficiently using Krivine realizability with primitive numerals, and prove that the corresponding program is but the direct-style equivalent (using call-cc) of the CPS-style program underlying Friedman’s method.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Barendregt, H.: The Lambda Calculus: Its Syntax and Semantics. Studies in Logic and The Foundations of Mathematics, vol. 103. North-Holland, Amsterdam (1984)zbMATHGoogle Scholar
  2. 2.
    Friedman, H.: Classically and intuitionistically provably recursive functions. Higher Set Theory 669, 21–28 (1978)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge University Press, Cambridge (1989)zbMATHGoogle Scholar
  4. 4.
    Krivine, J.-L.: A general storage theorem for integers in call-by-name lambda-calculus. Th. Comp. Sc. 129, 79–94 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Krivine, J.-L.: Typed lambda-calculus in classical Zermelo-Fraenkel set theory. Arch. Math. Log. 40(3), 189–205 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Krivine, J.-L.: Dependent choice, ‘quote’ and the clock. Th. Comp. Sc. 308, 259–276 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Krivine, J.-L.: Realizability in classical logic. Unpublished lecture notes (available on the author’s web page) (2005)Google Scholar
  8. 8.
    Miquel, A.: Classical program extraction in the calculus of constructions. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 313–327. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  9. 9.
    Oliva, P., Streicher, T.: On Krivine’s realizability interpretation of classical second-order arithmetic. Fundam. Inform. 84(2), 207–220 (2008)MathSciNetzbMATHGoogle Scholar
  10. 10.
    The Coq Development Team (LogiCal Project). The Coq Proof Assistant Reference Manual – Version 8.1. Technical report, INRIA (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Alexandre Miquel
    • 1
  1. 1.Université Paris 7 & LIP (ENS Lyon)France

Personalised recommendations