Hostname: page-component-7dd5485656-s6l46 Total loading time: 0 Render date: 2025-10-30T15:49:57.769Z Has data issue: false hasContentIssue false
  • English
  • Français

End-extensions preserving power set

Published online by Cambridge University Press:  12 March 2014

Thomas Forster  and
Richard Kaye
Thomas Forster
Affiliation:
Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, Cambridge CB2 1SB, England
Richard Kaye
Affiliation:
Jesus College, Oxford OX1 3DW, England
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider the quantifier hierarchy of Takahashi [1972] and show how it gives rise to reflection theorems for some large cardinals in ZF, a new natural subtheory of Zermelo's set theory, a potentially useful new reduction of the consistency problem for Quine's NF, and a sharpening of another reduction of this problem due to Boffa.

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 56 , Issue 1 , March 1991 , pp. 323 - 328
Copyright
Copyright © Association for Symbolic Logic 1991

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

References

REFERENCES

Boffa, M. [1988], ZFJ and the consistency problem for NF, Jahrbuch der Kurt-Gödel-Gesellschaft, vol. 1988, pp. 102–106.Google Scholar
Feferman, S. and Kreisel, G. [1966], Persistent and invariant formulas relative to theories of higher order, Bulletin of the American Mathematical Society, vol. 72, pp. 480–485.CrossRefGoogle Scholar
Forster, T. E. [1987], Permutation models in the sense of Rieger-Bernays, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 33, pp. 201–210.CrossRefGoogle Scholar
Forster, T. E. [199?], Set theory with a universal set, Oxford Logic Guides, Oxford University Press, Oxford (to appear).CrossRefGoogle Scholar
Henson, C. Ward [1973], Permutation methods applied to NF, this Journal, vol. 38, pp. 69–76.Google Scholar
Kaye, R. [1991], A generalization of Speaker's theorem on typical ambiguity, this Journal, vol. 56 (to appear).Google Scholar
Lévy, A. [1965], A hierarchy of formulas in set theory, Memoirs of the American Mathematical Society, no. 57, American Mathematical Society, Providence, Rhode Island.CrossRefGoogle Scholar
Specker, E. [1962], Typical ambiguity, Logic, methodology and philosophy of science (Nagel, E.et al., editors), Stanford University Press, Stanford, California, pp. 116–124.Google Scholar
Takahashi, Moto-O [1972], -definability in set theory, Conference in mathematical logic—London '70, Lecture Notes in Mathematics, vol. 255, Springer-Verlag, Berlin, pp. 281–304.CrossRefGoogle Scholar