Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-24T17:36:19.157Z Has data issue: false hasContentIssue false
  • English
  • Français

ZF + “Every set is the same size as a wellfounded set”

Published online by Cambridge University Press:  12 March 2014

Thomas Forster
Thomas Forster*
Affiliation:
Centre for Mathematical Sciences, Wilberforce RD Cambridge CB3 0WB, England, E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

Let ZFB be ZF + “every set is the same size as a wellfounded set”. Then the following are true.

Every sentence true in every (Rieger-Bernays) permutation model of a model of ZF is a theorem of ZFB. (i.e., ZFB is the theory of Rieger-Bernays permutation models of models of ZF) ZF and ZFAFA are both extensions of ZFB conservative for stratified formulæ. The class of models of ZFB is closed under creation of Rieger-Bernays permutation models.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 68 , Issue 1 , March 2003 , pp. 1 - 4
Copyright
Copyright © Association for Symbolic Logic 2003

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]Coret, J., Formules stratifiées et axiome de fondation, Comptes Rendus hebdomadaires ties séances de l'Académie des Sciences de Paris série A, vol. 264 (1964), pp. 809–12 and 837-9.Google Scholar
[2]Forster, T. E., Permutation models and stratified formulae, a preservation theorem, Zeitschrift für mathematische Logic und Grundlagen der Mathematik, vol. 36 (1990), pp. 385–388.CrossRefGoogle Scholar
[3]Forster, T. E., Logic, induction and sets, Cambridge University Press, 2003, in press.CrossRefGoogle Scholar
[4]Forster, T. E., Kaye, R. M., and Mathias, A. R. D., More on the set theory KF.Google Scholar
[5]Forti, M. and Honsell, F., Axioms of choice and free construction principles I, Bulletin de la Société Mathématique de Belgique série B, vol. 36 (1984), pp. 69–79.Google Scholar
[6]Mathias, A. R. D., The strength of Mac Lane set theory, Annals of Pure and Aplied Logic, (2001), pp. 107–234.Google Scholar