Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-25T06:08:38.674Z Has data issue: false hasContentIssue false
  • English
  • Français

Minimal models of Heyting arithmetic

Published online by Cambridge University Press:  12 March 2014

Ieke Moerdijk  and
Erik Palmgren
Ieke Moerdijk
Affiliation:
Mathematical Institute, University of Utrecht, PO Box 80.010, NL-3508 TA Utrecht, The Netherlands E-mail: moerdijk@math.ruu.nl
Erik Palmgren
Affiliation:
Department of Mathematics, Uppsala University, PO Box 480, S-751 06 Uppsala, Sweden E-mail: palmgren@math.uu.se
Get access Rights & Permissions [Opens in a new window]

Extract

In this paper, we give a constructive nonstandard model of intuitionistic arithmetic (Heyting arithmetic). We present two axiomatisations of the model: one finitary and one infinitary variant. Using the model these axiomatisations are proven to be conservative over ordinary intuitionistic arithmetic. The definition of the model along with the proofs of its properties may be carried out within a constructive and predicative metatheory (such as Martin-Löf's type theory). This paper gives an illustration of the use of sheaf semantics to obtain effective proof-theoretic results.

The axiomatisations of nonstandard intuitionistic arithmetic (to be called HAI and HAIω respectively) as well as their model are based on the construction in [5] of a sheaf model for arithmetic using a site of filters. In this paper we present a “minimal” version of this model, built instead on a suitable site of provable filter bases. The construction of this site can be viewed as an extension of the well-known construction of the classifying topos for a geometric theory which uses “syntactic sites”. (Such sites can in fact be used to prove semantical completeness of first order logic in a strictly constructive framework, see [6].)

We should mention that for classical nonstandard arithmetics there are several nonconstructive methods of proving conservativity over arithmetic, e.g. the compactness theorem, Mac Dowell–Specker's theorem [3].

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 62 , Issue 4 , December 1997 , pp. 1448 - 1460
Copyright
Copyright © Association for Symbolic Logic 1997

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]Coquand, TH. and Smith, J. M., An application of constructive completeness, Proceedings of the workshop TYPES '95, Torino, Italy, June 1995 (Berardi, S. and Coppo, M., editors), Lecture Notes in Computer Science, vol. 1158, Springer-Verlag, Berlin, 1996.Google Scholar
[2]Dragalin, A. G., An explicit Boolean-valued model for the non-standard arithmetic, Publicationes Mathematicae, Debrecen, vol. 42 (1993), pp. 369–389.CrossRefGoogle Scholar
[3]Kaye, R., Models of Peano arithmetic, Clarendon Press, Oxford, 1991.CrossRefGoogle Scholar
[4]Lane, S. Mac and Moerdijk, I., Sheaves in geometry and logic, Springer-Verlag, 1992.Google Scholar
[5]Moerdijk, I., A model for intuitionistic non-standard arithmetic, Annals of Pure and Applied Logic, vol. 73 (1995), pp. 37–51.CrossRefGoogle Scholar
[6]Palmgren, E., Constructive sheaf semantics, Mathematical Logic Quarterly, to appear.Google Scholar
[7]Palmgren, E., A note on ‘Mathematics of infinity’, this Journal, vol. 58 (1993), pp. 1195–1200.Google Scholar
[8]Palmgren, E., A constructive approach to nonstandard analysis, Annals of Pure and Applied Logic, vol. 73 (1995), pp. 297–325.CrossRefGoogle Scholar