Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-28T17:11:52.701Z Has data issue: false hasContentIssue false

On the derivability of instantiation properties

Published online by Cambridge University Press:  12 March 2014

Harvey Friedman*
Affiliation:
State University of New York at BuffaloAmherst, New York 14226

Abstract

Every recursively enumerable extension of arithmetic which obeys the disjunction property obeys the numerical existence property [Fr, 1]. The requirement of recursive enumerability is essential. For extensions of intuitionistic second order arithmetic by means of sentences (in its language) with no existential set quantifiers, the numerical existence property implies the set existence property. The restriction on existential set quantifiers is essential. The numerical existence property cannot be eliminated, but in the case of finite extensions of HAS, can be replaced by a weaker form of it. As a consequence, the set existence property for intuitionistic second order arithmetic can be proved within itself.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1977

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

[Fr, 1]Friedman, H., The disjunction property implies the numerical existence property, Proceedings of the National Academy of Sciences, vol. 72 (1975), no. 8, pp. 28772878.CrossRefGoogle ScholarPubMed
[Fr, 2]Friedman, H., Some applications of Kleene's methods for intuitionistic systems, Lecture Notes in Mathematics, vol. 337 (1973), pp. 113170.CrossRefGoogle Scholar
[JS]de Jongh, D. H. J. and Smorynski, C., Kripke models and the theory of species, University of Amsterdam, Report 74–03, 1974.Google Scholar
[Kl, 1]Kleene, S. C., On the interpretation of intuitionistic number theory, this Journal, vol. 10 (1945), pp. 109124.Google Scholar
[Kl, 2]Kleene, S. C., Disjunction and existence under implication in elementary intuitionistic formalisms, this Journal, vol. 27 (1962), pp. 1118.Google Scholar
[KT]Kreisel, G. and Troelstra, A., Formal systems for some branches of intuitionistic analysis, Annals of Mathematical Logic, vol. 1 (1970), pp. 229387.CrossRefGoogle Scholar
[My]Myhill, J., A note on indicator-functions, Proceedings of the American Mathematical Society, vol. 39 (1973), pp. 181183.CrossRefGoogle Scholar
[Pr]Prawitz, D., Ideas and results in proof theory, Proceedings of the Second Scandinavian Logic Symposium (Fenstad, J. E., Editor), North-Holland, Amsterdam, 1971, pp. 235307.CrossRefGoogle Scholar
[Sm]Smorynski, C., Applications of Kripke models, Lecture Notes in Mathematics, vol. 344 (1973), pp. 324391.CrossRefGoogle Scholar
[Tr, 1]Troelstra, A., Notions of realizability for intuitionistic arithmetic and intuitionistic arithmetic in all finite types, Proceedings of the Second Scandinavian Logic Symposium (Fenstad, J. E., Editor), North-Holland, Amsterdam, 1971, pp. 369405.CrossRefGoogle Scholar
[Tr, 2]Troelstra, A., Notes on intuitionistic second order arithmetic, Lecture Notes in Mathematics, vol. 337 (1973), pp. 171205.CrossRefGoogle Scholar
[Tr, 3]Troelstra, A., Realizability and functional interpretations, Lecture Notes in Mathematics, vol. 344 (1973), pp. 175274.CrossRefGoogle Scholar