Hostname: page-component-8448b6f56d-42gr6 Total loading time: 0 Render date: 2024-04-19T04:28:18.095Z Has data issue: false hasContentIssue false
  • English
  • Français

Constructive forcing, CPS translations and witness extraction in Interactive realizability†

Published online by Cambridge University Press:  29 October 2015

FEDERICO ASCHIERI
FEDERICO ASCHIERI*
Affiliation:
Institute of Discrete Mathematics and Geometry, Vienna University of Technology, Wiedner Haupstrasse 8-10 1040 Vienna, Austria Email: federico.aschieri@tuwien.ac.at
Get access Rights & Permissions [Opens in a new window]

Abstract

In Interactive realizability for second-order Heyting Arithmetic with EM1 and SK1 (the excluded middle and Skolem axioms restricted to Σ10-formulas), realizers are written in a classical version of Girard's System F. Since the usual reducibility semantics does not apply to such a system, we introduce a constructive forcing/reducibility semantics: though realizers are not computable functionals in the sense of Girard, they can be forced to be computable. We apply this semantics to show how to extract witnesses for realizable Π20-formulas. In particular, a constructive and efficient method is introduced. It is based on a new ‘(state-extending-continuation)-passing-style translation’ whose properties are described with the constructive forcing/reducibility semantics.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 27 , Issue 6 , September 2017 , pp. 993 - 1031
Copyright
Copyright © Cambridge University Press 2015 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

†

This work was supported by the LABEX MILYON (ANR-10-LABX-0070) of Université de Lyon, within the program ‘Investissements d'Avenir’ (ANR-11-IDEX-0007) operated by the French National Research Agency (ANR).

References

Aschieri, F. (2011a). Learning, Realizability and Games in Classical Arithmetic, Ph.D. thesis. http://arxiv.org/abs/1012.4992 Google Scholar
Aschieri, F. (2011b). Transfinite update procedures for predicative systems of analysis. In Proceedings of Computer Science Logic, Leibniz International Proceedings in Informatics 12 20–34.Google Scholar
Aschieri, F. (2011c). A constructive analysis of learning in Peano arithmetic. Annals of Pure and Applied Logic 162 (11) 1448–1470.Google Scholar
Aschieri, F. (2013). Interactive realizability for second-order arithmetic with EM1 and SK1. Mathematical Structures in Computer Science 24 (6).Google Scholar
Aschieri, F. and Berardi, S. (2010). Interactive learning-based realizability for heyting arithmetic with EM 1 . Logical Methods in Computer Science 6 (3).Google Scholar
Aschieri, F. and Berardi, S. (2011). A new use of Friedman's translation: Interactive realizability. In: Logic, Construction, Computation, Ontos-Verlag Mathematical Logic.Google Scholar
Avigad, J. (2002). Update procedures and 1-consistency of arithmetic. Mathematical Logic Quarterly 48 (1) 3–13.Google Scholar
Avigad, J. (2003). Eliminating definitions and Skolem functions in first-order logic. ACM Transactions on Computational Logic 4 (3) 402–415.Google Scholar
Avigad, J. (2004). Forcing in proof thoery. Bulletin of Symbolic Logic 10 (3) 305–333.CrossRefGoogle Scholar
Berardi, S., Bezem, M. and Coquand, T. (1998). On the computational content of the axiom of choice. Journal of Symbolic Logic 63 (2) 600–622.Google Scholar
Berardi, S. and de'Liguoro, U. (2008). A calculus of realizers for EM1 arithmetic. Computer Science Logic, Lecture Notes in Computer Science 5213 215–229.CrossRefGoogle Scholar
Berger, U. (2005). Strong normalization for applied Lambda calculi. Logical Methods in Computer Science.CrossRefGoogle Scholar
Cohen, P. (1967). Set Theory and the Continuum Hypothesis, Dover publications.Google Scholar
Escardo, M. (2013). Continuity of Gödel's system T functionals via effectful forcing. Mathematical Foundation of Programming Semantics, Electronic Notes in Theoretical Computer Science 298 119–141.Google Scholar
Escardo, M. and Oliva, P. (2010). Selection functions, bar recursion and backward induction. Mathematical Structures in Computer Science 20 (2) 127–168.Google Scholar
Friedman, H. (1978). Classically and intuitionistically provable recursive functions. Lecture Notes in Mathematics 669 21–27.CrossRefGoogle Scholar
Girard, J.-Y. (1989). Proofs and Types, Cambridge University Press.Google Scholar
Goodman, N.D. (1978). Relativized realizability in intuitionistic arithmetic of all finite types. Journal of Symbolic Logic 43 (1) 23–44.Google Scholar
Griffin, T. (1990). A formulae-as-type notion of control. In: Proc. of POPL 47–58.Google Scholar
Kohlenbach, U. (2008). Applied Proof Theory, Springer-Verlag, Berlin, Heidelberg.Google Scholar
Kreisel, G. (1951). On the interpretation of non-finitist proofs, part I. Journal of Symbolic Logic 16 (4) 241–267.Google Scholar
Kreisel, G. (1959). Interpretation of analysis by means of constructive functionals of finite types. In: Heyting, A. (ed.) Constructivity in Mathematics, North-Holland, Amsterdam, 101–128.Google Scholar
Krivine, J.-L. (2009). Realizability in classical logic. In Interactive Models of Computation and Program Behaviour. Panoramas et synthses, Socit Mathmatique de France 27 197–229.Google Scholar
Krivine, J.-L. (2011). Realizability algebras: a program to well-order R. Logical Methods in Computer Science 7 (3).Google Scholar
Mints, G., Tupailo, S. and Bucholz, W. (1996). Epsilon substitution method for elementary analysis. Archive for Mathematical Logic 35 103–130.Google Scholar
Miquel, A. (2011). Forcing as a program transformation. Logic in Computer Science 197–206.CrossRefGoogle Scholar
Moggi, E. (1991). Notions of computations and Monads. Journal of Logic and Computation 93 (1) 55–92.Google Scholar
Murthy, C. (1990). Extracting Constructive Content from Mathematical Proofs, Ph.D. thesis, Cornell University.Google Scholar
Oliva, P. and Streicher, T. (2008). On Krivine realizability interpretation of second-order classical arithmetic. Fundamenta Informaticae.Google Scholar
Parigot, M. (1992). Lambda-my-calculus: An algorithmic interpretation of classical natural deduction. In LPAR 1992: 190–201.Google Scholar
Sorensen, M.H. and Urzyczyn, P. (2006). Lectures on the Curry-Howard isomorphism. Studies in Logic and the Foundations of Mathematics, 149, Elsevier.Google Scholar
Spector, C. (1962). Provably recursive functionals of analysis: A consistency proof of analysis by an extension of principles in current intuitionistic mathematics. In: Dekker (ed.) Recursive Function Theory: Proceedings of Symposia in Pure Mathematics, 5. AMS, Providence.Google Scholar