Primitive independence results

Journal of Mathematical Logic 3 (1):67-83 (2003)
  Copy   BIBTEX

Abstract

We present some new set and class theoretic independence results from ZFC and NBGC that are particularly simple and close to the primitives of membership and equality. They are shown to be equivalent to familiar small large cardinal hypotheses. We modify these independendent statements in order to give an example of a sentence in set theory with 5 quantifiers which is independent of ZFC. It is known that all 3 quantifier sentences are decided in a weak fragment of ZF without power set

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,888

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Truth in V for Ǝ ∀∀-Sentences Is Decidable.D. Bellé & F. Parlamento - 2006 - Journal of Symbolic Logic 71 (4):1200 - 1222.
Decreasing sentences in Simple Type Theory.Panagiotis Rouvelas - 2017 - Mathematical Logic Quarterly 63 (5):342-363.
The hyperuniverse program.Tatiana Arrigoni & Sy-David Friedman - 2013 - Bulletin of Symbolic Logic 19 (1):77-96.
The downward directed grounds hypothesis and very large cardinals.Toshimichi Usuba - 2017 - Journal of Mathematical Logic 17 (2):1750009.

Analytics

Added to PP
2009-01-28

Downloads
319 (#87,223)

6 months
3 (#1,470,822)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

The ∀ n∃‐Completeness of Zermelo‐Fraenkel Set Theory.Daniel Gogol - 1978 - Mathematical Logic Quarterly 24 (19-24):289-290.
Subtle cardinals and linear orderings.Harvey M. Friedman - 2000 - Annals of Pure and Applied Logic 107 (1-3):1-34.

Add more references