Understanding and using spector's bar recursive interpretation of classical analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3988 LNCS, Issue , 2006, Pages 423-434

  Oliva, Paulo ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; INFORMATION RETRIEVAL; PROGRAM INTERPRETERS; THEOREM PROVING;

BAR RECURSION; CLASSICAL ANALYSIS; COMPUTATIONAL INTERPRETATION;

COMPUTATION THEORY;

EID: 33746089929     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11780342_44     Document Type: Conference Paper

References (7)

1. J. Avigad. Update procedures and the 1-consistency of arithmetic. Mathematical Logic Quarterly, 48:3-13, 2002.
2. U. Berger and P. Oliva. Modified bar recursion and classical dependent choice. Lecture Notes in Logic, 20:89-107, 2005.
3. K. Gödel. Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes. Dialectica, 12:280-287, 1958.
4. . S. Kuroda. Intuitionistische Untersuchungen der formalistischen Logik. Nagoya Mathematical Journal, 3:35-47, 1951.
5. P. Oliva. Unifying functional interpretations. To appear in: Notre Dame Journal of Formal Logic, 2006.
6. 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.
7. A. S. Troelstra (ed.). Metamathematical Investigation of Intuitionistic Arithmetic and Analysis, volume 344 of Lecture Notes in Mathematics. Springer, Berlin, 1973.