Light Dialectica revisited

Annals of Pure and Applied Logic

Volumn 161, Issue 11, 2010, Pages 1379-1389

  Hernest, Mircea Dan ^a   Trifonov, Trifon ^b  

^a UNIVERSITY OF LISBON   (Portugal)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

Automated program synthesis; Computational content of proofs; Functional interpretations; Light Dialectica interpretation; Light uniform quantifiers; Program extraction from proofs

Indexed keywords

EID: 77954621191     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2010.04.008     Document Type: Article

References (18)

1. Avigad J., Feferman S. Gödel's functional ("Dialectica") interpretation. Studies in Logic and the Foundations of Mathematics 1998, vol. 137:337-405. North Holland, Amsterdam. S.R. Buss (Ed.).
2. Berger U. Uniform Heyting Arithmetic. Annals of Pure and Applied Logic 2005, 133:125-148.
3. Berger U., Schwichtenberg H., Buchholz W. Refined program extraction from classical proofs. Annals of Pure and Applied Logic 2002, 114:3-25.
4. Girard J.-Y. Linear logic. Theoretical Computer Science 1987, 50(1):1-102.
5. Gödel K. Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes. Dialectica 1958, 12:280-287.
6. Hernest M.-D. Light Functional Interpretation (Computer Science Logic: 19th International Workshop, CSL 2005). Lecture Notes in Computer Science 2005, vol. 3634:477-492.
7. M.-D. Hernest, Optimized programs from (non-constructive) proofs by the light (monotone) Dialectica interpretation, PhD Thesis, École Polytechnique and Universität München, 2006. http://www.brics.dk/~danher/teza/thesfull.pdf.
8. Hernest M.-D., Oliva P. Hybrid functional interpretations. Lecture Notes in Computer Science 2008, vol. 5028:251-260. Springer Verlag. A. Beckmann, C. Dimitracopoulos, B. Löwe (Eds.).
9. Kohlenbach U. A note on Spector's quantifier-free rule of extensionality. Archive for Mathematical Logic 2001, 40:89-92.
10. Oliva P. Unifying functional interpretations. Notre Dame Journal of Formal Logic 2006, 47(2):263-290.
11. Oliva P. Computational interpretations of classical linear logic. LNCS 2007, vol. 4576:285-296. Springer.
12. Oliva P. An analysis of Gödel's Dialectica interpretation via linear logic. Dialectica 2008, 62:269-290.
13. H. Schwichtenberg, Content in proofs of list reversal, Marktoberdorf Summer School (2007).. http://www.math.lmu.de/~schwicht/papers/mod07/mod07.pdf.
14. H. Schwichtenberg, Minimal Logic for Computable Functionals, MinLog documentation. , December 2005. http://www.math.lmu.de/~minlog/minlog/mlcf.pdf.
15. Schwichtenberg H. Dialectica interpretation of well-founded induction. Mathematical Logic Quarterly 2008, 54(3):229-239.
16. Spector C. Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles in current intuitionistic mathematics. Recursive Function Theory: Proceedings of Symposia in Pure Mathematics 1962, vol.~5:1-27. American Mathematical Society, Providence, Rhode Island, USA.
17. Trifonov T. Dialectica interpretation with fine computational control. Lecture Notes in Computer Science 2009, vol. 5635:467-477. Springer. K. Ambos-Spies, B. Löwe, W. Merkle (Eds.).
18. Troelstra A.S. Metamathematical Investigation of Intuitionistic Arithmetic and Analysis. Lecture Notes in Mathematics 1973, vol. 344. Springer-Verlag.