Hostname: page-component-848d4c4894-75dct Total loading time: 0 Render date: 2024-05-07T21:49:58.337Z Has data issue: false hasContentIssue false

How to glue analysis models

Published online by Cambridge University Press:  12 March 2014

D. Van Dalen*
Affiliation:
Mathematisch Instituut, Rijksuniversiteit Utrecht, Utrecht, The Netherlands

Extract

Among the more traditional semantics for intuitionistic logic the Beth and the Kripke semantics seem well-suited for direct manipulations required for the derivation of metamathematical results. In particular Smoryński demonstrated the usefulness of Kripke models for the purpose of obtaining closure properties for first-order arithmetic, [S], and second-order arithmetic, [J-S]. Weinstein used similar techniques to handle intuitionistic analysis, [W]. Since, however, Beth-models seem to lend themselves better for dealing with analysis, cf. [D], we have developed a somewhat more liberal semantics, that shares the features of both Kripke and Beth semantics, in order to obtain analogues of Smoryński's collecting operations, which we will call Smoryński-glueing, in line with the categorical tradition.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1984

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

[D]van Dalen, D., An interpretation of intuitionistic analysis, Annals of Mathematical Logic, vol. 13 (1978), pp. 143.CrossRefGoogle Scholar
[J-S]de Jongh, D. H. J. and Smoryński, C., Kripke models and the theory of species, Annals of Mathematical Logic, vol. 9 (1976), pp. 157186.CrossRefGoogle Scholar
[K]Kleene, S. C., Formalized recursive junctionals and formalized realizability. Memoirs of the American Mathematical Society, no. 87 (1969).Google Scholar
[K-V]Kleene, S. C. and Vesley, R. E., The foundations of intuitionistic mathematics, North-Holland, Amsterdam, 1965.Google Scholar
[Kr]Krol, M. D.′, Disjunctive and existential properties of intuitionistic analysis with Kripke's scheme, Soviet Mathematics Doklady, vol. 18 (1977), pp. 755758.Google Scholar
[L-S]Lambek, J. and Scott, P. J., Intuitionistic type theory and the free topos, Journal of Pure and Applied Algebra, vol. 19 (1980), pp. 576619.CrossRefGoogle Scholar
[L]López-Escobar, E. G. K., Integrating intuitionistic and classical theories, Fundamenta Mathematicae, vol. 112 (1981), pp. 125140.CrossRefGoogle Scholar
[Moe]Moerdijk, I., Glueing topoi and higher-order disjunction and existence. The L. E, J. Brouwer centenary symposium (Troelstra, A. S. and van Dalen, D., editors), North-Holland, Amsterdam, 1982, pp. 359376.Google Scholar
[M1]Moschovakis, J. R., Disjunction and existence in formalized intuitionistic analysis, Sets, models and recursion theory (Crossley, J. N., editor), North-Holland, Amsterdam, 1967, pp. 309331.CrossRefGoogle Scholar
[M2]Moschovakis, J. R., Disjunction and existence properties for intuitionistic analysis with Kripke's schema (abstract), this Journal, vol. 44 (1979), p. 469.Google Scholar
[M3]Moschovakis, J. R., A disjunctive decomposition theorem for classical theories, Constructive mathematics (Richman, F., editor). Lecture Notes in Mathematics, vol. 873, Springer-Verlag, Berlin, 1981, pp. 250259.CrossRefGoogle Scholar
[M4]Moschovakis, J. R., Can there be no nonrecursive functions?, this Journal, vol. 36 (1971), pp. 309315.Google Scholar
[S]Smoryński, C., Applications of Kripke models, in [T], pp. 324391.CrossRefGoogle Scholar
[T]Troelstra, A. S., Metamathematical investigation of intuitionistic arithmetic and analysis, Lecture Notes in Mathematics, vol. 344, Springer-Verlag, Berlin, 1973.CrossRefGoogle Scholar
[W]Weinstein, S., Some applications of Kripke models to formal systems of intuitionistic analysis. Annals of Mathematical Logic, vol. 16(1979), pp. 132.CrossRefGoogle Scholar