Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-29T00:36:34.614Z Has data issue: false hasContentIssue false

The unprovability in intuitionistic formal systems of the continuity of effective operations on the reals

Published online by Cambridge University Press:  12 March 2014

Michael Beeson*
Affiliation:
University of California, Santa Cruz, California 95064

Extract

The question of continuity of functions defined on Baire space NN or on the reals has been of great interest to constructivists. We have little hope of answering the question without a fundamental philosophical analysis of the notion of constructive function. However, one can ask whether the continuity of functions can be derived in known intuitionistic formal systems, and answer these questions by mathematical means.

The constructivist does not generally wish to restrict himself to reals (or members of NN ) given by a recursive law; therefore the most natural formal systems have variables for reals, sequences and functions. The axioms of these systems turn out to be compatible with the assumption that every real or sequence is given by a recursive law, and every function by an effective operation. An underivability result, therefore, is only strengthened if this assumption is taken as an axiom; and once this is done, we may as well work with (indices of) effective operations, within arithmetic.

By KLS is meant the assertion that each effective operation on Baire space NN is continuous. In [B1] it is shown that this statement cannot be proved in various intuitionistic formal systems. The continuity of functions on the reals has been of even greater interest to constructivists than the continuity of functions on NN ; by KLS(R) is meant the assertion that each effective operation from the real numbers R to R is continuous. It is the purpose of the present note to show that KLS(R) is also underivable in intuitionistic formal systems.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1976

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[B1] Beeson, M. J., The nonderivability in intuitionistic formal systems of theorems on the continuity of effective operations, this Journal, vol. 40 (1975), pp. 321346.Google Scholar
[B2] Beeson, M. J., Derived rules of inference related to the continuity of effective operations, this Journal, vol. 40 (1975).Google Scholar
[Bi] Bishop, E., Foundations of constructive analysis, McGraw-Hill, 1967.Google Scholar
[L] Lacombe, D., Remarques sur les opérateurs recursifs et sur les fonctions recursives d'une variable réelle, Comptes Rendus, vol. 241, pp. 12501252.Google Scholar
[Tr] Troelstra, A., Notions of realizability for intuitionistic arithmetic and intuitionistic arithmetic in all finite types, Proceedings of the Second Scandinavian Logic Symposium (Fensted, J. E., Editor), North-Holland, Amsterdam, 1971.Google Scholar