A completeness theorem for Zermelo-Fraenkel set theory

Journal of Symbolic Logic 41 (2):323-327 (1976)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



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

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

The ∀n∃‐Completeness of Zermelo‐Fraenkel Set Theory.Daniel Gogol - 1978 - Mathematical Logic Quarterly 24 (19‐24):289-290.
The ∀ n∃‐Completeness of Zermelo‐Fraenkel Set Theory.Daniel Gogol - 1978 - Mathematical Logic Quarterly 24 (19-24):289-290.
Global quantification in zermelo-Fraenkel set theory.John Mayberry - 1985 - Journal of Symbolic Logic 50 (2):289-301.
An extension of a theorem of zermelo.Jouko Väänänen - 2019 - Bulletin of Symbolic Logic 25 (2):208-212.
The independence of Ramsey's theorem.E. M. Kleinberg - 1969 - Journal of Symbolic Logic 34 (2):205-206.

Analytics

Added to PP
2009-01-28

Downloads
58 (#355,062)

6 months
22 (#131,746)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On adopting Kripke semantics in set theory.Luca Incurvati - 2008 - Review of Symbolic Logic 1 (1):81-96.

Add more citations

References found in this work

Ackermann's set theory equals ZF.William N. Reinhardt - 1970 - Annals of Mathematical Logic 2 (2):189.

Add more references