This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
U. Berger. Program extraction from normalization proofs. In M. Bezem and J. Groote, editors, Typed Lambda Calculi and Applications, volume 664 of LNCS, pages 91-106. Springer Verlag, Berlin, Heidelberg, New York, 1993.
U. Berger. Uniform Heyting arithmetic. Annals Pure Applied Logic, 133: 125-148, 2005
U. Berger, H. Schwichtenberg, and M. Seisenberger. The Warshall Al-gorithm and Dickson’s Lemma: Two Examples of Realistic Program Extraction. Journal of Automated Reasoning, 26: 205-221, 2001.
U. Berger, W. Buchholz, and H. Schwichtenberg. Refined program extraction from classical proofs. Annals of Pure and Applied Logic, 114: 3-25, 2002.
U. Berger, S. Berghofer, P. Letouzey, and H. Schwichtenberg. Program extraction from normalization proofs. Studia Logica, 82: 27-51, 2006.
J. Berger and H. Ishihara. Brouwer’s fan theorem and unique existence in constructive analysis. Mathematical Logic Quarterly, 51 (4): 360-364, 2005.
U. Berger and H. Schwichtenberg. Program develop-ment by proof transformation. In H. Schwichtenberg, editor, Proof and Computation, volume 139 of Series F: Computer and Systems Sciences, pages 1-45. NATO Advanced Study Institute, International Summer School held in Marktoberdorf, Germany, July 20 -August 1, 1993, Springer Verlag, Berlin, Heidelberg, New York, 1995.
H. Friedman. Classically and intuitionistically provably recursive func-tions. In D. Scott and G. Müller, editors, Higher Set Theory, volume 669 of Lecture Notes in Mathematics, pages 21-28. Springer Verlag, Berlin, Heidelberg, New York, 1978.
K. Gödel. Über eine bisher noch nicht benützte Erweiterung des finiten Stand-punkts. Dialectica, 12: 280-287, 1958.
M.-D. Hernest. Feasible programs from (non-constructive) proofs by the light (monotone) Dialectica interpretation. PhD thesis, Ecole Polytechnique Paris and LMU München, 2006.
W. A. Howard. Hereditarily majorizable functionals of finite type. In A. Troelstra, editor, Mathematical Investigation of Intuitionistic Arithmetic and Analysis, volume 344 of Lecture Notes in Mathematics, pages 454-461. Springer Verlag, Berlin, Heidelberg, New York, 1973.
H. Ishihara. An omniscience principle, the König lemma and the Hahn-Banach theorem. Zeitschr. f. math. Logik und Grundlagen d. Math., 36: 237-240, 1990.
H. Ishihara. Weak König lemma implies Brouwer’s fan theorem: a direct proof. Notre Dame J. Formal Logic, 47: 249-252, 2006.
K. F. Jørgensen. Finite type arithmetic. Master’s thesis, University of Roskilde, 2001.
U. Kohlenbach. Effective bounds from ineffective proofs in analysis: an application of functional interpretation and majorization. The Journal of Symbolic Logic, 57 (4): 1239-1273, 1992.
U. Kohlenbach. Analysing proofs in analysis. In W. Hodges, M. Hy-land, C. Steinhorn, and J. Truss, editors, Logic: from Foundations to Applications. Euro-pean Logic Colloquium (Keele, 1993), pages 225-260. Oxford University Press, 1996.
P. Oliva. Unifying functional interpretations. Notre Dame J. Formal Logic, 47: 262-290, 2006.
H. Schwichtenberg. Proofs as programs. In P. Aczel, H. Simmons, and S. Wainer, editors, Proof Theory. A selection of papers from the Leeds Proof Theory Programme 1990, pages 81-113. Cambridge University Press, 1993.
H. Schwichtenberg. A direct proof of the equivalence between Brouwer’s fan theorem and König’s lemma with a uniqueness hypothesis. Journal of Universal Computer Science, 11 (12): 2086-2095, 2005. http://www.jucs.org/ jucs_11_12/a_direct_proof_of.
H. Schwichtenberg. Recursion on the partial continuous function-als. In C. Dimitracopoulos, L. Newelski, D. Normann, and J. Steel, editors, Logic Collo-quium ’05, volume 28 of Lecture Notes in Logic, pages 173-201. Association for Sym-bolic Logic, 2006.
M. Seisenberger. On the constructive content of proofs. PhD thesis, Mathematisches Institut der Universität München, 2003.
A. S. Troelstra, editor. Metamathematical Investigation of Intuitionistic Arithmetic and Analysis, volume 344 of Lecture Notes in Mathematics. Springer Verlag, Berlin, Heidelberg, New York, 1973.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Schwichtenberg, H. (2008). New Developments in Proofs and Computations. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds) New Computational Paradigms. Springer, New York, NY. https://doi.org/10.1007/978-0-387-68546-5_14
Download citation
DOI: https://doi.org/10.1007/978-0-387-68546-5_14
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-36033-1
Online ISBN: 978-0-387-68546-5
eBook Packages: Computer ScienceComputer Science (R0)