Truth in V for Ǝ ∀∀-Sentences Is Decidable

Journal of Symbolic Logic 71 (4):1200 - 1222 (2006)
Let V be the cumulative set theoretic hierarchy, generated from the empty set by taking powers at successor stages and unions at limit stages and, following [2], let the primitive language of set theory be the first order language which contains binary symbols for equality and membership only. Despite the existence of ∀∀-formulae in the primitive language, with two free variables, which are satisfiable in V but not by finite sets ([5]), and therefore of ƎƎ∀∀ sentences of the same language, which are undecidable in ZFC without the Axiom of Infinity, truth in V for Ǝ*∀∀-sentences of the primitive language, is decidable ([1]). Completeness of ZF with respect to such sentences follows
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1164060452
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 24,433
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Daniel Gogol (1978). The ∀N∃-Completeness of Zermelo-Fraenkel Set Theory. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24 (19-24):289-290.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

7 ( #500,080 of 1,924,984 )

Recent downloads (6 months)

1 ( #417,998 of 1,924,984 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.