A computational interpretation of open induction

Proceedings - Symposium on Logic in Computer Science

Volumn 19, Issue , 2004, Pages 326-334

  Berger, Ulrich ^a  

^a SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; FORMAL LOGIC; MACHINE ORIENTED LANGUAGES; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; PROBLEM ORIENTED LANGUAGES; THEOREM PROVING;

COMBINATORY LOGICS; MATHEMATICAL CONSTRUCTIVITY; RECURSIVE FUNCTION THEORY;

COMPUTER SCIENCE;

EID: 4544387499     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/lics.2004.1319627     Document Type: Conference Paper

References (29)

1. J. Avigad and S. Feferman. Gödel's functional ("Dialectica") interpretation. In S. Buss, editor, Handbook of proof theory, volume 137, pages 337-405. Elsevier, North-Holland, Amsterdam, 1998.
2. S. Berardi, M. Bezem, and T. Coquand. On the computational content of the axiom of choice. Journal of Symbolic Logic, 63(2):600-622, 1998.
3. U. Berger and P. Oliva. Modified bar recursion and classical dependent choice. In Logic Colloquium 2001. Springer, to appear.
4. U. Berger, H. Schwichtenberg, and W. Buchholz. Refined program extraction from classical proofs. Annals of Pure and Applied Logic, to appear.
5. W. Burr. Diller-Nahm-style functional interpretation of KPwω. Archive for Mathematical Logic, 39(8):599-604, 2000.
6. T. Coquand. Constructive toplogy and combinators. In Constructivity in Computer Science, volume 613 of Lecture Notes in Computer Science, pages 159-164. Springer, 1991.
7. T. Coquand. A note on the open induction principle, 1997.
8. J. Diller and W. Nahm. Eine Variante zur Dialectica-Interpretation der Heyting-Arithmetik endlicher Typen. Archiv für mathematische Logik und Grundlagenforschung, 16:49-66, 1974.
9. Y. Ershov. Model C of partial continuous functional. In R. Gandy and M. Hyland, editors, Logic Colloquium 1976, pages 455-467. North Holland, Amsterdam, 1977.
10. S. Feferman. Gödel's Dialectica interpretation and its two-way stretch. In G. e. a. Gottlob, editor, Computational Logic and Proof Theory, Lecture Notes in Computer Science, volume 713, pages 23-40. Springer, 1993.
11. H. Friedman. Classically and intuitionistically provably recursive functions. In D. Scott and G. Müller, editors, Higher Set Theory, Lecture Notes in Mathematics, volume 669, pages 21-28. Springer, 1978.
12. K. Gödel. Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes. Dialectica, 12:280-287, 1958.
13. P. Howard and J. Rubin. Consequences of the Axiom of Choice. Math. Surv. and Monographs, vol. 58. American Mathematical Society, 1998.
14. W. A. Howard and G. Kreisel. Transfinite induction and bar induction of types zero and one, and the role of continuity in intuitionistic analysis. Journal of Symbolic Logic, 31(3):325-358, 1966.
15. S. C. Kleene. Countable functionals. In A. Heyting, editor, Constructivity in Mathematics, pages 81-100. NorthHolland, Amsterdam, 1959.
16. U. Kohlenbach. On uniform weak König's lemma. Annals of Pure and Applied Logic, 114:103-116, 2002.
17. G. Kreisel. Interpretation of analysis by means of constructive functionals of finite types. Constructivity in Mathematics, pages 101-128, 1959.
18. J.-L. Krivine. Countable choice and 'quote'. Unpublished, 2002.
19. H. Luckhardt. Extensional Gödel Functional Interpretation - A Consistency Proof of Classical Analysis, volume 306 of Lecture Notes in Mathematics. Springer, 1973.
20. A. Mahboubi. An induction principle over real numbers. Submitted to Archive for Mathematical Logic, 2004.
21. C. Nash-Williams. On well-quasi-ordering finite trees. Proc. Cambridge Phil. Soc., 59:833-835, 1963.
22. D. Normann. Recursion on the countable functionals, volume 811 of Lecture Notes in Mathematics. Springer, 1980.
23. G. D. Plotkin, LCF considered as a programming language. Theoretical Computer Science, 5:223-255, 1977.
24. J.-C. Raoult. Proving open properties by induction. Information processing letters, 29:19-23, 1988.
25. H. Schwichtenberg and S. Wainer. Ordinal bounds for programs. In P. Clote and J. Remmel, editors, Feasible Mathematics II, pages 387-406. Birkhäuser, Boston, 1995.
26. D. S. Scott. Outline of a mathematical theory of computation. In 4th Annual Princeton Conference on Information Sciences and Systems, pages 169-176, 1970.
27. C. Spector. Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles in current intuitionistic mathematics. In F. D. E. Dekker, editor, Recursive Function Theory: Proc. Symposia in Pure Mathematics, volume 5, pages 1-27. American Mathematical Society, Providence, Rhode Island, 1962.
28. A. Troelstra. Metamathematical investigation of intuitionistic Arithmetic and Analysis, volume 344 of Lecture Notes in Mathematics. Springer, 1973.
29. A. Troelstra. Extended bar induction of type zero. In The Kleene Symposium. North-Holland, 1980.