Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-15T05:35:31.947Z Has data issue: false hasContentIssue false
  • English
  • Français

Minimum models of analysis1

Published online by Cambridge University Press:  12 March 2014

J. R. Shilleto
J. R. Shilleto*
Affiliation:
University of Saskatchewan, Regina, Canada
Get accessRights & Permissions [Opens in a new window]

Extract

Although there is no smallest ω model [6], Putnam and Gandy independently proved about 1963 that the class of ramified analytical sets, as defined by Cohen [3], form the smallest β model of analysis [2], [8]. This paper will consider other restricted classes of models, namely the βn models for integers n > 1 [10], and prove under appropriate assumptions the existence of minimum such models. In fact we shall construct the minimum βn model in a fashion similar to the procedure yielding the class of ramified analytical sets, but adding at each stage a segment of the sets in those already obtained (for n a fixed integer > 1).

Roughly speaking a βn model is an ω model absolute for n-set-quantifier assertions about its subsets of natural numbers. A β model is simply a β1 model. See Enderton and Friedman [4] for a further investigation of βn models.

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 37 , Issue 1 , March 1972, pp. 48 - 54
Copyright
Copyright © Association for Symbolic Logic 1972

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.)

Article purchase

Temporarily unavailable

Footnotes

1

This paper presents the work of the author's doctoral dissertation submitted to the University of California at Berkeley in February 1969.

References

BIBLIOGRAPHY

[1]Addison, J. W., Some consequences of the axiom of constructibility, Fundamenta Mathematicae, vol. 46 (1959), pp. 337–357.CrossRefGoogle Scholar
[2]Boyd, R., Hensel, G., and Putnam, H., A recursion-theoretic characterization of the ramified analytical hierarchy, Transactions of the American Mathematical Society, vol. 141 (1969), pp. 37–62.CrossRefGoogle Scholar
[3]Cohen, Paul J., A minimal model for set theory, Bulletin of the American Mathematical Society, vol. 69 (1963), pp. 537–540.CrossRefGoogle Scholar
[4]Enderton, H. B. and Friedman, Harvey, Approximating the standard model of analysis, forthcoming.Google Scholar
[5]Gödel, Kurt, The consistency of the axiom of choice and of the generalized continuum hypothesis with the axioms of set-theory, Annals of Mathematical Studies, no. 2, second edition, Princeton Univ. Press, Princeton, N.J., 1940.Google Scholar
[6]Gandy, R. O., Kreisel, G., and Tait, W. W., Set existence, Bulletin de l' Academie Polonaise des Sciences, Serie des Sciences, vol. 8 (1960), pp. 577–582.Google Scholar
[7]Grzegorczyk, A., Mostowski, A., and Ryll-Nardzewski, C., The classical and the ω-complete arithmetic, this Journal, vol. 23 (1958), pp. 188–200.Google Scholar
[8]Mostowski, A., Formal system of analysis based on an infinitistic rule of proof, Infinististic methods, Proceedings of the Symposium on the Foundations of Mathematics, Pergamon Press, Oxford, 1961, pp. 141–166.Google Scholar
[9]Rogers, Hartley Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.Google Scholar
[10]Shilleto, J. R., The arithmetic of standard models of ZF, Notices of the American Mathematical Society, vol. 15 (1968), p. 549.Google Scholar
[11]Shoenfield, J. R., The problem of predicativity, Essays on the foundations of mathematics, Magnes Press, Jerusalem, 1961, pp. 132–139.Google Scholar