A Calibration of Ineffective Theorems of Analysis in a Hierarchy of Semi-classical Logical Principles
We classify a number of nonconstructive mathematical theorems by means of a hierarchy of logical principles which are not included in intuitionistic logic. The main motivation is the development of the logical hierarchy by Akama Y. et al. and its connection to the so-called limit computable mathematics and proof animations developed by Hayashi S. et al. The results presented give insights in both the scope of limit computable mathematics and its subsystems, and the nature of the theorems of classical mathematics considered.
Unable to display preview. Download preview PDF.
- 1.Akama, Y., Berardi, S., Hayashi, S., Kohlenbach, U.: An arithmetical hierachy of the laws of excluded middle and related principles. In: Proc. of the 19th Annual IEEE Symposium on Logic in Computer Science, LICS 2004 (2004) (to appear)Google Scholar
- 6.Ishihara, H.: Informal Constructive Reverse Mathematics. Research Report Series 229, Centre for Discrete Mathematics and Theoretical Computer Science (2004)Google Scholar
- 10.Mandelkern, M.: Constructive continuity. Mem. Amer. Math. Soc. 42(277) (1983)Google Scholar
- 14.Shoenfield, J.R.: Recursion theory, Urbana, IL. Lecture Notes in Logic. Association for Symbolic Logic, vol. 1 (2001); Reprint of the 1993 originalGoogle Scholar
- 16.Specker, E.: Der Satz vom Maximum in der rekursiven Analysis. In: Heyting, A. (ed.) Constructivity in mathematics: Proceedings of the colloquium, Amsterdam, 1957. Studies in Logic and the Foundations of Mathematics, pp. 254–265. North-Holland Publishing Co., Amsterdam (1959)Google Scholar
- 17.Toftdal, M.: Calibration of ineffective theorems of analysis in a constructive context. Master’s thesis, Department of Computer Science, University of Aarhus (May 2004)Google Scholar