Hostname: page-component-848d4c4894-4rdrl Total loading time: 0 Render date: 2024-07-07T03:19:14.181Z Has data issue: false hasContentIssue false
  • English
  • Français

Relativized realizability in intuitionistic arithmetic of all finite types

Published online by Cambridge University Press:  12 March 2014

Nicolas D. Goodman
Nicolas D. Goodman*
Affiliation:
Suny at Buffalo, Amherst, NY 14226
Get access Rights & Permissions [Opens in a new window]

Extract

In this paper we introduce a new notion of realizability for intuitionistic arithmetic in all finite types. The notion seems to us to capture some of the intuition underlying both the recursive realizability of Kjeene [5] and the semantics of Kripke [7]. After some preliminaries of a syntactic and recursion-theoretic character in §1, we motivate and define our notion of realizability in §2. In §3 we prove a soundness theorem, and in §4 we apply that theorem to obtain new information about provability in some extensions of intuitionistic arithmetic in all finite types. In §5 we consider a special case of our general notion and prove a kind of reflection theorem for it. Finally, in §6, we consider a formalized version of our realizability notion and use it to give a new proof of the conservative extension theorem discussed in Goodman and Myhill [4] and proved in our [3]. (Apparently, a form of this result is also proved in Mine [13]. We have not seen this paper, but are relying on [12].) As a corollary, we obtain the following somewhat strengthened result: Let Σ be any extension of first-order intuitionistic arithmetic (HA) formalized in the language of HA. Let Σω be the theory obtained from Σ by adding functionals of finite type with intuitionistic logic, intensional identity, and axioms of choice and dependent choice at all types. Then Σω is a conservative extension of Σ. An interesting example of this theorem is obtained by taking Σ to be classical first-order arithmetic.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 43 , Issue 1 , March 1978 , pp. 23 - 44
Copyright
Copyright © Association for Symbolic Logic 1978

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

[1]Goodman, N. D., A simplification of combinatory logic, this Journal, vol. 37 (1972), pp. 225–246.Google Scholar
[2]Goodman, N. D., The arithmetic theory of constructions, Proceedings of the Cambridge Summer School in Mathematical Logic, 1971 (Mathias, A. R. D. and Rogers, H., Editors), Springer, Berlin, 1973, pp. 274–298.CrossRefGoogle Scholar
[3]Goodman, N. D., The theory of the Gödel functional, this Journal, vol. 41 (1976), pp. 574–582.Google Scholar
[4]Goodman, N. D. and Myhill, J., The formalization of Bishop's constructive mathematics, Toposes, algebraic geometry, and logic (Lawvere, F. W., Editor), Springer, Berlin, 1972, pp. 83–96.CrossRefGoogle Scholar
[5]Kleene, S. C., On the interpretation of intuitionistic number theory, this Journal, vol. 10 (1945), pp. 109–124.Google Scholar
[6]Kleene, S. C., Introduction to metamathematics, Van Nostrand, New York, 1952.Google Scholar
[7]Kripke, S. A., Semantical analysis of intuitionistic logic. I, Formal systems and recursive functions (Crossley, J. N. and Dummett, M. A. E., Editors), North-Holland, Amsterdam, 1965, pp. 92–130.CrossRefGoogle Scholar
[8]Sasso, L. P. Jr., Degrees of unsolvability of partial functions, Dissertation, University of California at Berkeley, 1971.Google Scholar
[9]Sasso, L. P. Jr., A survey of partial degrees, this Journal, vol. 40 (1975), pp. 130–140.Google Scholar
[10]Spector, C., Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles formulated in current intuitionistic mathematics, Recursive function theory (Dekker, J. C. E., Editor), American Mathematical Society, Providence, R.I., 1962, pp. 1–27.Google Scholar
[11]Troelstra, A. S., Notions of realizability for intuitionistic arithmetic in all finite types, Proceedings of the Second Scandinavian Logic Symposium (Fenstad, J. E., Editor), North-Holland, Amsterdam, 1971, pp. 369–405.CrossRefGoogle Scholar
[12]Kuzičev, A. S., Review of [13], Mathematical Reviews, vol. 52 (1976), # 5375.Google Scholar
[13]Minc, G. E., Finite studies of deduction (Russian, English summary), Zapiski Naučnyk Seminarov Leningradskogo Otdelenija Matematičeskogo Instituta im. V. A. Steklova Akademii Nauk SSSR (LOMI), vol. 49 (1975), pp. 67–122, pp. 177–178.Google Scholar